Base | Representation |
---|---|
bin | 1010000011110010000110… |
… | …10100011101010111000101 |
3 | 2220022200010112112102210222 |
4 | 11001321003110131113011 |
5 | 10344404143004323023 |
6 | 115013515030154125 |
7 | 4442063310166553 |
oct | 501710324352705 |
9 | 86280115472728 |
10 | 22120211011013 |
11 | 7059146496705 |
12 | 2593065ab2945 |
13 | c45c0867354b |
14 | 5668a40a0bd3 |
15 | 2855e65eacc8 |
hex | 141e4351d5c5 |
22120211011013 has 2 divisors, whose sum is σ = 22120211011014. Its totient is φ = 22120211011012.
The previous prime is 22120211011009. The next prime is 22120211011081. The reversal of 22120211011013 is 31011011202122.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22115180371684 + 5030639329 = 4702678^2 + 70927^2 .
It is a cyclic number.
It is not a de Polignac number, because 22120211011013 - 22 = 22120211011009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22120211010982 and 22120211011000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22120211019013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060105505506 + 11060105505507.
It is an arithmetic number, because the mean of its divisors is an integer number (11060105505507).
Almost surely, 222120211011013 is an apocalyptic number.
It is an amenable number.
22120211011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22120211011013 is an equidigital number, since it uses as much as digits as its factorization.
22120211011013 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 17.
Adding to 22120211011013 its reverse (31011011202122), we get a palindrome (53131222213135).
The spelling of 22120211011013 in words is "twenty-two trillion, one hundred twenty billion, two hundred eleven million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •