Base | Representation |
---|---|
bin | 1001101001000000011111… |
… | …01001000101100100101111 |
3 | 2210001201110212000200102121 |
4 | 10310200033221011210233 |
5 | 10234321023034031111 |
6 | 113031125211333411 |
7 | 4315444145143501 |
oct | 464401751054457 |
9 | 83051425020377 |
10 | 21200221002031 |
11 | 6833a66081235 |
12 | 24648b3151267 |
13 | baa2315ca276 |
14 | 53414bc73d71 |
15 | 26b6ee178871 |
hex | 13480fa4592f |
21200221002031 has 2 divisors, whose sum is σ = 21200221002032. Its totient is φ = 21200221002030.
The previous prime is 21200221002029. The next prime is 21200221002041. The reversal of 21200221002031 is 13020012200212.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21200221002031 - 21 = 21200221002029 is a prime.
It is a super-2 number, since 2×212002210020312 (a number of 27 digits) contains 22 as substring.
Together with 21200221002029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 21200221001996 and 21200221002014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200221002001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600110501015 + 10600110501016.
It is an arithmetic number, because the mean of its divisors is an integer number (10600110501016).
Almost surely, 221200221002031 is an apocalyptic number.
21200221002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200221002031 is an equidigital number, since it uses as much as digits as its factorization.
21200221002031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 21200221002031 its reverse (13020012200212), we get a palindrome (34220233202243).
The spelling of 21200221002031 in words is "twenty-one trillion, two hundred billion, two hundred twenty-one million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •