Base | Representation |
---|---|
bin | 1010000000100110111001… |
… | …11111010010010010110111 |
3 | 2212221020112210112222222022 |
4 | 11000103130333102102313 |
5 | 10341112233210032411 |
6 | 114451434031223355 |
7 | 4431152034003353 |
oct | 500233477222267 |
9 | 85836483488868 |
10 | 22011120002231 |
11 | 701695545a108 |
12 | 2575a9b677b5b |
13 | c3884159a689 |
14 | 5614b58d8463 |
15 | 28285e208edb |
hex | 1404dcfd24b7 |
22011120002231 has 2 divisors, whose sum is σ = 22011120002232. Its totient is φ = 22011120002230.
The previous prime is 22011120002227. The next prime is 22011120002233. The reversal of 22011120002231 is 13220002111022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22011120002231 - 22 = 22011120002227 is a prime.
It is a super-2 number, since 2×220111200022312 (a number of 27 digits) contains 22 as substring.
Together with 22011120002233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22011120002233) 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, 11005560001115 + 11005560001116.
It is an arithmetic number, because the mean of its divisors is an integer number (11005560001116).
Almost surely, 222011120002231 is an apocalyptic number.
22011120002231 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011120002231 is an equidigital number, since it uses as much as digits as its factorization.
22011120002231 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 17.
Adding to 22011120002231 its reverse (13220002111022), we get a palindrome (35231122113253).
The spelling of 22011120002231 in words is "twenty-two trillion, eleven billion, one hundred twenty million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •