Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …0001010011000111100101 |
3 | 1022102221211011020100111022 |
4 | 2101222220201103013211 |
5 | 2303001141340213104 |
6 | 33142324342420525 |
7 | 2052130431315401 |
oct | 221525041230745 |
9 | 38387734210438 |
10 | 10010101101029 |
11 | 320a2951217a7 |
12 | 1158036731745 |
13 | 577c43a83693 |
14 | 2686c488c101 |
15 | 1255bbb21bbe |
hex | 91aa88531e5 |
10010101101029 has 2 divisors, whose sum is σ = 10010101101030. Its totient is φ = 10010101101028.
The previous prime is 10010101100939. The next prime is 10010101101053. The reversal of 10010101101029 is 92010110101001.
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., 6680534516929 + 3329566584100 = 2584673^2 + 1824710^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010101101029 - 232 = 10005806133733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010101100998 and 10010101101016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010101101229) 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, 5005050550514 + 5005050550515.
It is an arithmetic number, because the mean of its divisors is an integer number (5005050550515).
Almost surely, 210010101101029 is an apocalyptic number.
It is an amenable number.
10010101101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010101101029 is an equidigital number, since it uses as much as digits as its factorization.
10010101101029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 10010101101029 in words is "ten trillion, ten billion, one hundred one million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •