Base | Representation |
---|---|
bin | 1010000110101111111100… |
… | …10000010110001000011111 |
3 | 2220200102012112221202011022 |
4 | 11003113332100112020133 |
5 | 10403041411132120111 |
6 | 115132412320314355 |
7 | 4452332064213662 |
oct | 503277620261037 |
9 | 86612175852138 |
10 | 22222131520031 |
11 | 7098397a05643 |
12 | 25aa96aa729bb |
13 | c526cc017851 |
14 | 56b7b22076d9 |
15 | 2880ae2452db |
hex | 1435fe41621f |
22222131520031 has 2 divisors, whose sum is σ = 22222131520032. Its totient is φ = 22222131520030.
The previous prime is 22222131519937. The next prime is 22222131520073. The reversal of 22222131520031 is 13002513122222.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22222131520031 is a prime.
It is a super-2 number, since 2×222221315200312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22222131520081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11111065760015 + 11111065760016.
It is an arithmetic number, because the mean of its divisors is an integer number (11111065760016).
Almost surely, 222222131520031 is an apocalyptic number.
22222131520031 is a deficient number, since it is larger than the sum of its proper divisors (1).
22222131520031 is an equidigital number, since it uses as much as digits as its factorization.
22222131520031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 22222131520031 its reverse (13002513122222), we get a palindrome (35224644642253).
The spelling of 22222131520031 in words is "twenty-two trillion, two hundred twenty-two billion, one hundred thirty-one million, five hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •