Base | Representation |
---|---|
bin | 1001001100100011100010… |
… | …0100001000110001111101 |
3 | 1022210122001000121021221012 |
4 | 2103020320210020301331 |
5 | 2311130421303341104 |
6 | 33301022405245005 |
7 | 2062342330005221 |
oct | 223107044106175 |
9 | 38718030537835 |
10 | 10111302012029 |
11 | 32491a7426029 |
12 | 117377a703765 |
13 | 58465131613a |
14 | 26d5651d8781 |
15 | 1280414c6d6e |
hex | 93238908c7d |
10111302012029 has 2 divisors, whose sum is σ = 10111302012030. Its totient is φ = 10111302012028.
The previous prime is 10111302011989. The next prime is 10111302012043. The reversal of 10111302012029 is 92021020311101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7620277435225 + 2491024576804 = 2760485^2 + 1578298^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111302012029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111302011995 and 10111302012013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111302012079) 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, 5055651006014 + 5055651006015.
It is an arithmetic number, because the mean of its divisors is an integer number (5055651006015).
Almost surely, 210111302012029 is an apocalyptic number.
It is an amenable number.
10111302012029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111302012029 is an equidigital number, since it uses as much as digits as its factorization.
10111302012029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 10111302012029 in words is "ten trillion, one hundred eleven billion, three hundred two million, twelve thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •