Base | Representation |
---|---|
bin | 10010101001011101… |
… | …11001110010011011 |
3 | 221211201102201012002 |
4 | 21110232321302123 |
5 | 131000422003214 |
6 | 4333233311215 |
7 | 503044324316 |
oct | 112456716233 |
9 | 27751381162 |
10 | 10011516059 |
11 | 4278270216 |
12 | 1b34a0550b |
13 | c371c00cc |
14 | 6ad8bd97d |
15 | 3d8dd51de |
hex | 254bb9c9b |
10011516059 has 2 divisors, whose sum is σ = 10011516060. Its totient is φ = 10011516058.
The previous prime is 10011516049. The next prime is 10011516083. The reversal of 10011516059 is 95061511001.
It is a weak prime.
It is an emirp because it is prime and its reverse (95061511001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011516059 - 228 = 9743080603 is a prime.
It is a super-2 number, since 2×100115160592 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10011516049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005758029 + 5005758030.
It is an arithmetic number, because the mean of its divisors is an integer number (5005758030).
Almost surely, 210011516059 is an apocalyptic number.
10011516059 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011516059 is an equidigital number, since it uses as much as digits as its factorization.
10011516059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 29.
The spelling of 10011516059 in words is "ten billion, eleven million, five hundred sixteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •