Base | Representation |
---|---|
bin | 1001101001000101101110… |
… | …10000110001010111111111 |
3 | 2210001222201211200010222122 |
4 | 10310202313100301113333 |
5 | 10234342302444401002 |
6 | 113032312230433155 |
7 | 4315603633344662 |
oct | 464426720612777 |
9 | 83058654603878 |
10 | 21203033200127 |
11 | 6835179530299 |
12 | 2465358b027bb |
13 | baa58c1086cc |
14 | 5343375516d9 |
15 | 26b815ec26a2 |
hex | 1348b74315ff |
21203033200127 has 2 divisors, whose sum is σ = 21203033200128. Its totient is φ = 21203033200126.
The previous prime is 21203033200049. The next prime is 21203033200133. The reversal of 21203033200127 is 72100233030212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21203033200127 - 220 = 21203032151551 is a prime.
It is a super-2 number, since 2×212030332001272 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21203033200096 and 21203033200105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21203033200187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601516600063 + 10601516600064.
It is an arithmetic number, because the mean of its divisors is an integer number (10601516600064).
Almost surely, 221203033200127 is an apocalyptic number.
21203033200127 is a deficient number, since it is larger than the sum of its proper divisors (1).
21203033200127 is an equidigital number, since it uses as much as digits as its factorization.
21203033200127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
Adding to 21203033200127 its reverse (72100233030212), we get a palindrome (93303266230339).
The spelling of 21203033200127 in words is "twenty-one trillion, two hundred three billion, thirty-three million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •