Base | Representation |
---|---|
bin | 1011000110001111111111… |
… | …1000000111011000100111 |
3 | 1121012111111100202101100212 |
4 | 2301203333320013120213 |
5 | 3044404144001133111 |
6 | 41541304343330035 |
7 | 2366364635606432 |
oct | 261437770073047 |
9 | 47174440671325 |
10 | 12202000021031 |
11 | 39849259a7447 |
12 | 14509b515091b |
13 | 6a684a192852 |
14 | 302819562819 |
15 | 162606c5d98b |
hex | b18ffe07627 |
12202000021031 has 2 divisors, whose sum is σ = 12202000021032. Its totient is φ = 12202000021030.
The previous prime is 12202000021019. The next prime is 12202000021039. The reversal of 12202000021031 is 13012000020221.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (13012000020221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12202000021031 - 218 = 12201999758887 is a prime.
It is a super-2 number, since 2×122020000210312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12202000020997 and 12202000021015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202000021039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101000010515 + 6101000010516.
It is an arithmetic number, because the mean of its divisors is an integer number (6101000010516).
Almost surely, 212202000021031 is an apocalyptic number.
12202000021031 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202000021031 is an equidigital number, since it uses as much as digits as its factorization.
12202000021031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 12202000021031 its reverse (13012000020221), we get a palindrome (25214000041252).
The spelling of 12202000021031 in words is "twelve trillion, two hundred two billion, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •