Base | Representation |
---|---|
bin | 1001001011111101100001… |
… | …1110111011100111000001 |
3 | 1022202122201000220110121202 |
4 | 2102333120132323213001 |
5 | 2310444023111200113 |
6 | 33252214211030545 |
7 | 2061531451123445 |
oct | 222773036734701 |
9 | 38678630813552 |
10 | 10101100100033 |
11 | 32449417425a8 |
12 | 11717b1b9b455 |
13 | 5836b6852317 |
14 | 26cc78316825 |
15 | 127b45a33258 |
hex | 92fd87bb9c1 |
10101100100033 has 2 divisors, whose sum is σ = 10101100100034. Its totient is φ = 10101100100032.
The previous prime is 10101100099997. The next prime is 10101100100053. The reversal of 10101100100033 is 33000100110101.
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., 5253846184129 + 4847253915904 = 2292127^2 + 2201648^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101100100033 - 214 = 10101100083649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101100099987 and 10101100100023.
It is not a weakly prime, because it can be changed into another prime (10101100100053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050550050016 + 5050550050017.
It is an arithmetic number, because the mean of its divisors is an integer number (5050550050017).
Almost surely, 210101100100033 is an apocalyptic number.
It is an amenable number.
10101100100033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101100100033 is an equidigital number, since it uses as much as digits as its factorization.
10101100100033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 10101100100033 its reverse (33000100110101), we get a palindrome (43101200210134).
The spelling of 10101100100033 in words is "ten trillion, one hundred one billion, one hundred million, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •