Base | Representation |
---|---|
bin | 1001000110101010111001… |
… | …1010101001110000101001 |
3 | 1022102222002001101001122002 |
4 | 2101222232122221300221 |
5 | 2303001342201201212 |
6 | 33142342234540345 |
7 | 2052133042165034 |
oct | 221525632516051 |
9 | 38388061331562 |
10 | 10010200022057 |
11 | 320a335a46614 |
12 | 11580638976b5 |
13 | 577c5b40a031 |
14 | 2686d3a7c01b |
15 | 1255c5661ac2 |
hex | 91aae6a9c29 |
10010200022057 has 2 divisors, whose sum is σ = 10010200022058. Its totient is φ = 10010200022056.
The previous prime is 10010200021963. The next prime is 10010200022059. The reversal of 10010200022057 is 75022000201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9935835277456 + 74364744601 = 3152116^2 + 272699^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010200022057 - 228 = 10009931586601 is a prime.
It is a super-2 number, since 2×100102000220572 (a number of 27 digits) contains 22 as substring.
Together with 10010200022059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10010200022059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005100011028 + 5005100011029.
It is an arithmetic number, because the mean of its divisors is an integer number (5005100011029).
Almost surely, 210010200022057 is an apocalyptic number.
It is an amenable number.
10010200022057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010200022057 is an equidigital number, since it uses as much as digits as its factorization.
10010200022057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 20.
Adding to 10010200022057 its reverse (75022000201001), we get a palindrome (85032200223058).
The spelling of 10010200022057 in words is "ten trillion, ten billion, two hundred million, twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •