Base | Representation |
---|---|
bin | 1010000110011001101111… |
… | …01111001101100111010111 |
3 | 2220122021102210102010221222 |
4 | 11003030313233031213113 |
5 | 10402343003004323111 |
6 | 115123121410400555 |
7 | 4451430506443301 |
oct | 503146757154727 |
9 | 86567383363858 |
10 | 22210211011031 |
11 | 709333010780a |
12 | 25a85a289015b |
13 | c5154c495824 |
14 | 56ada0d9c971 |
15 | 287b129777db |
hex | 143337bcd9d7 |
22210211011031 has 2 divisors, whose sum is σ = 22210211011032. Its totient is φ = 22210211011030.
The previous prime is 22210211011013. The next prime is 22210211011129. The reversal of 22210211011031 is 13011011201222.
It is a happy number.
Together with previous prime (22210211011013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22210211011031 - 234 = 22193031141847 is a prime.
It is a super-2 number, since 2×222102110110312 (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 (22210211011231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105105505515 + 11105105505516.
It is an arithmetic number, because the mean of its divisors is an integer number (11105105505516).
Almost surely, 222210211011031 is an apocalyptic number.
22210211011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210211011031 is an equidigital number, since it uses as much as digits as its factorization.
22210211011031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 22210211011031 its reverse (13011011201222), we get a palindrome (35221222212253).
The spelling of 22210211011031 in words is "twenty-two trillion, two hundred ten billion, two hundred eleven million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •