Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …11000111000110011110101 |
3 | 2220121111020122000110021211 |
4 | 11003011032120320303311 |
5 | 10402224144240200041 |
6 | 115115243011441421 |
7 | 4451020166366551 |
oct | 503051630706365 |
9 | 86544218013254 |
10 | 22202001100021 |
11 | 708a8a78a8096 |
12 | 25a6a912b6271 |
13 | c50841608212 |
14 | 56a822892861 |
15 | 2877d1d16481 |
hex | 14314e638cf5 |
22202001100021 has 2 divisors, whose sum is σ = 22202001100022. Its totient is φ = 22202001100020.
The previous prime is 22202001100003. The next prime is 22202001100061. The reversal of 22202001100021 is 12000110020222.
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., 21950293192996 + 251707907025 = 4685114^2 + 501705^2 .
It is a cyclic number.
It is not a de Polignac number, because 22202001100021 - 231 = 22199853616373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22202001099974 and 22202001100010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22202001100061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11101000550010 + 11101000550011.
It is an arithmetic number, because the mean of its divisors is an integer number (11101000550011).
Almost surely, 222202001100021 is an apocalyptic number.
It is an amenable number.
22202001100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22202001100021 is an equidigital number, since it uses as much as digits as its factorization.
22202001100021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 22202001100021 its reverse (12000110020222), we get a palindrome (34202111120243).
The spelling of 22202001100021 in words is "twenty-two trillion, two hundred two billion, one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •