Base | Representation |
---|---|
bin | 11001011101110110000110… |
… | …000110011110000000011101 |
3 | 112200120022000202112101112222 |
4 | 121131312012012132000131 |
5 | 104140020311134124014 |
6 | 1034113020540435125 |
7 | 32406612514065044 |
oct | 3135660606360035 |
9 | 480508022471488 |
10 | 112002112020509 |
11 | 3276191338a277 |
12 | 1068a914848aa5 |
13 | 4a659a5271ab9 |
14 | 1d92d070c955b |
15 | ce3672d2e08e |
hex | 65dd8619e01d |
112002112020509 has 2 divisors, whose sum is σ = 112002112020510. Its totient is φ = 112002112020508.
The previous prime is 112002112020481. The next prime is 112002112020511. The reversal of 112002112020509 is 905020211200211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97045097215609 + 14957014804900 = 9851147^2 + 3867430^2 .
It is a cyclic number.
It is not a de Polignac number, because 112002112020509 - 240 = 110902600392733 is a prime.
Together with 112002112020511, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112002112020559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56001056010254 + 56001056010255.
It is an arithmetic number, because the mean of its divisors is an integer number (56001056010255).
Almost surely, 2112002112020509 is an apocalyptic number.
It is an amenable number.
112002112020509 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002112020509 is an equidigital number, since it uses as much as digits as its factorization.
112002112020509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 26.
The spelling of 112002112020509 in words is "one hundred twelve trillion, two billion, one hundred twelve million, twenty thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •