Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01100100000110010101 |
3 | 10120122121000220210021222 |
4 | 32231210321210012111 |
5 | 113031022043014404 |
6 | 2052241315420125 |
7 | 133020526165265 |
oct | 16554471440625 |
9 | 3518530823258 |
10 | 1011010126229 |
11 | 35a84894a774 |
12 | 143b352b4645 |
13 | 7445132a32c |
14 | 36d0c7d17a5 |
15 | 1b473155dbe |
hex | eb64e64195 |
1011010126229 has 2 divisors, whose sum is σ = 1011010126230. Its totient is φ = 1011010126228.
The previous prime is 1011010126211. The next prime is 1011010126271. The reversal of 1011010126229 is 9226210101101.
1011010126229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 997391703025 + 13618423204 = 998695^2 + 116698^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011010126229 - 224 = 1010993349013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011010126198 and 1011010126207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011010126829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505505063114 + 505505063115.
It is an arithmetic number, because the mean of its divisors is an integer number (505505063115).
Almost surely, 21011010126229 is an apocalyptic number.
It is an amenable number.
1011010126229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011010126229 is an equidigital number, since it uses as much as digits as its factorization.
1011010126229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 1011010126229 in words is "one trillion, eleven billion, ten million, one hundred twenty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •