Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …11100111110100110101101 |
3 | 2212221010200120211210020202 |
4 | 11000102122330332212231 |
5 | 10341103001044213122 |
6 | 114451132053123245 |
7 | 4431112422001622 |
oct | 500223274764655 |
9 | 85833616753222 |
10 | 22010012101037 |
11 | 7016437038594 |
12 | 2575830629525 |
13 | c386c5bb153c |
14 | 56140c700349 |
15 | 2827e6d11e92 |
hex | 14049af3e9ad |
22010012101037 has 2 divisors, whose sum is σ = 22010012101038. Its totient is φ = 22010012101036.
The previous prime is 22010012101019. The next prime is 22010012101097. The reversal of 22010012101037 is 73010121001022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11091970472521 + 10918041628516 = 3330461^2 + 3304246^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22010012101037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22010012101097) 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, 11005006050518 + 11005006050519.
It is an arithmetic number, because the mean of its divisors is an integer number (11005006050519).
Almost surely, 222010012101037 is an apocalyptic number.
It is an amenable number.
22010012101037 is a deficient number, since it is larger than the sum of its proper divisors (1).
22010012101037 is an equidigital number, since it uses as much as digits as its factorization.
22010012101037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 22010012101037 its reverse (73010121001022), we get a palindrome (95020133102059).
The spelling of 22010012101037 in words is "twenty-two trillion, ten billion, twelve million, one hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •