Base | Representation |
---|---|
bin | 1010000100000100101110… |
… | …11000010001000111111001 |
3 | 2220100121221110201012121102 |
4 | 11002002113120101013321 |
5 | 10400040133033331301 |
6 | 115022251221421145 |
7 | 4442566156513544 |
oct | 502022730210771 |
9 | 86317843635542 |
10 | 22130211230201 |
11 | 7062408340368 |
12 | 2594b96b6a7b5 |
13 | c46b404096c9 |
14 | 56717227d85b |
15 | 2859ce4edb6b |
hex | 1420976111f9 |
22130211230201 has 2 divisors, whose sum is σ = 22130211230202. Its totient is φ = 22130211230200.
The previous prime is 22130211230131. The next prime is 22130211230219. The reversal of 22130211230201 is 10203211203122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20956033106176 + 1174178124025 = 4577776^2 + 1083595^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22130211230201 is a prime.
It is not a weakly prime, because it can be changed into another prime (22130211235201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11065105615100 + 11065105615101.
It is an arithmetic number, because the mean of its divisors is an integer number (11065105615101).
Almost surely, 222130211230201 is an apocalyptic number.
It is an amenable number.
22130211230201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22130211230201 is an equidigital number, since it uses as much as digits as its factorization.
22130211230201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 22130211230201 its reverse (10203211203122), we get a palindrome (32333422433323).
The spelling of 22130211230201 in words is "twenty-two trillion, one hundred thirty billion, two hundred eleven million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •