Base | Representation |
---|---|
bin | 1001001100100110100110… |
… | …0000110110001111001101 |
3 | 1022210201011020212122122012 |
4 | 2103021221200312033031 |
5 | 2311134112021430404 |
6 | 33301240103031005 |
7 | 2062401561165143 |
oct | 223115140661715 |
9 | 38721136778565 |
10 | 10112123233229 |
11 | 3249588a40736 |
12 | 117396973b465 |
13 | 5847524b9244 |
14 | 26d6022c9593 |
15 | 12808d641a6e |
hex | 932698363cd |
10112123233229 has 2 divisors, whose sum is σ = 10112123233230. Its totient is φ = 10112123233228.
The previous prime is 10112123233153. The next prime is 10112123233231. The reversal of 10112123233229 is 92233232121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7590013980004 + 2522109253225 = 2754998^2 + 1588115^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112123233229 - 240 = 9012611605453 is a prime.
Together with 10112123233231, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10112123233195 and 10112123233204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112123203229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056061616614 + 5056061616615.
It is an arithmetic number, because the mean of its divisors is an integer number (5056061616615).
Almost surely, 210112123233229 is an apocalyptic number.
It is an amenable number.
10112123233229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112123233229 is an equidigital number, since it uses as much as digits as its factorization.
10112123233229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 10112123233229 in words is "ten trillion, one hundred twelve billion, one hundred twenty-three million, two hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •