Base | Representation |
---|---|
bin | 1010000000100101000000… |
… | …01101001000000101000111 |
3 | 2212221010220201122201001121 |
4 | 11000102200031020011013 |
5 | 10341103141124021411 |
6 | 114451144521534411 |
7 | 4431114542002114 |
oct | 500224015100507 |
9 | 85833821581047 |
10 | 22010100220231 |
11 | 7016481854872 |
12 | 2575856044407 |
13 | c3870b225386 |
14 | 56141a2bb90b |
15 | 2827ee91b571 |
hex | 1404a0348147 |
22010100220231 has 2 divisors, whose sum is σ = 22010100220232. Its totient is φ = 22010100220230.
The previous prime is 22010100220211. The next prime is 22010100220247. The reversal of 22010100220231 is 13202200101022.
It is a happy number.
It is an a-pointer prime, because the next prime (22010100220247) can be obtained adding 22010100220231 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22010100220231 - 29 = 22010100219719 is a prime.
It is a super-2 number, since 2×220101002202312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22010100220211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005050110115 + 11005050110116.
It is an arithmetic number, because the mean of its divisors is an integer number (11005050110116).
Almost surely, 222010100220231 is an apocalyptic number.
22010100220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
22010100220231 is an equidigital number, since it uses as much as digits as its factorization.
22010100220231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 22010100220231 its reverse (13202200101022), we get a palindrome (35212300321253).
The spelling of 22010100220231 in words is "twenty-two trillion, ten billion, one hundred million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •