Base | Representation |
---|---|
bin | 1010000100000100101110… |
… | …11000010001000101000101 |
3 | 2220100121221110201012100202 |
4 | 11002002113120101011011 |
5 | 10400040133033330041 |
6 | 115022251221420245 |
7 | 4442566156513166 |
oct | 502022730210505 |
9 | 86317843635322 |
10 | 22130211230021 |
11 | 7062408340214 |
12 | 2594b96b6a685 |
13 | c46b404095bb |
14 | 56717227d76d |
15 | 2859ce4eda9b |
hex | 142097611145 |
22130211230021 has 2 divisors, whose sum is σ = 22130211230022. Its totient is φ = 22130211230020.
The previous prime is 22130211229991. The next prime is 22130211230069. The reversal of 22130211230021 is 12003211203122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20529009501025 + 1601201728996 = 4530895^2 + 1265386^2 .
It is a cyclic number.
It is not a de Polignac number, because 22130211230021 - 230 = 22129137488197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22130211229975 and 22130211230002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22130211230521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11065105615010 + 11065105615011.
It is an arithmetic number, because the mean of its divisors is an integer number (11065105615011).
Almost surely, 222130211230021 is an apocalyptic number.
It is an amenable number.
22130211230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22130211230021 is an equidigital number, since it uses as much as digits as its factorization.
22130211230021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 22130211230021 its reverse (12003211203122), we get a palindrome (34133422433143).
The spelling of 22130211230021 in words is "twenty-two trillion, one hundred thirty billion, two hundred eleven million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •