Base | Representation |
---|---|
bin | 1001001011111101010010… |
… | …0010011001110010101101 |
3 | 1022202122112102100012221012 |
4 | 2102333110202121302231 |
5 | 2310443404134314404 |
6 | 33252203444115005 |
7 | 2061530015341145 |
oct | 222772442316255 |
9 | 38678472305835 |
10 | 10101033901229 |
11 | 3244908338447 |
12 | 1171793995a65 |
13 | 5836a5c14a2b |
14 | 26cc6d603925 |
15 | 127b3ed08a6e |
hex | 92fd4899cad |
10101033901229 has 2 divisors, whose sum is σ = 10101033901230. Its totient is φ = 10101033901228.
The previous prime is 10101033901201. The next prime is 10101033901247. The reversal of 10101033901229 is 92210933010101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6925502773225 + 3175531128004 = 2631635^2 + 1782002^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101033901229 - 28 = 10101033900973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101033901195 and 10101033901204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101033901289) 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, 5050516950614 + 5050516950615.
It is an arithmetic number, because the mean of its divisors is an integer number (5050516950615).
Almost surely, 210101033901229 is an apocalyptic number.
It is an amenable number.
10101033901229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101033901229 is an equidigital number, since it uses as much as digits as its factorization.
10101033901229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 32.
The spelling of 10101033901229 in words is "ten trillion, one hundred one billion, thirty-three million, nine hundred one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •