Base | Representation |
---|---|
bin | 1001011111011100… |
… | …11010000110010001 |
3 | 111011010101110010002 |
4 | 10233232122012101 |
5 | 40413442140334 |
6 | 2201345415345 |
7 | 240163261226 |
oct | 45756320621 |
9 | 14133343102 |
10 | 5095661969 |
11 | 2185406292 |
12 | ba263a555 |
13 | 6329139c8 |
14 | 364a8394d |
15 | 1ec550b7e |
hex | 12fb9a191 |
5095661969 has 2 divisors, whose sum is σ = 5095661970. Its totient is φ = 5095661968.
The previous prime is 5095661953. The next prime is 5095661993. The reversal of 5095661969 is 9691665905.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5077275025 + 18386944 = 71255^2 + 4288^2 .
It is a cyclic number.
It is not a de Polignac number, because 5095661969 - 24 = 5095661953 is a prime.
It is a super-2 number, since 2×50956619692 = 51931541804625913922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5095661929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2547830984 + 2547830985.
It is an arithmetic number, because the mean of its divisors is an integer number (2547830985).
Almost surely, 25095661969 is an apocalyptic number.
It is an amenable number.
5095661969 is a deficient number, since it is larger than the sum of its proper divisors (1).
5095661969 is an equidigital number, since it uses as much as digits as its factorization.
5095661969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3936600, while the sum is 56.
The square root of 5095661969 is about 71383.9055319895. The cubic root of 5095661969 is about 1720.8124394453.
The spelling of 5095661969 in words is "five billion, ninety-five million, six hundred sixty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •