Base | Representation |
---|---|
bin | 10100101011111111… |
… | …111010011001010111 |
3 | 2010100001200212200021 |
4 | 110223333322121113 |
5 | 330443012323111 |
6 | 14112101530011 |
7 | 1414313323051 |
oct | 245377723127 |
9 | 63301625607 |
10 | 22213011031 |
11 | 9469735a62 |
12 | 437b113907 |
13 | 2130013513 |
14 | 110a18c8d1 |
15 | 8a01a7d71 |
hex | 52bffa657 |
22213011031 has 2 divisors, whose sum is σ = 22213011032. Its totient is φ = 22213011030.
The previous prime is 22213010969. The next prime is 22213011059. The reversal of 22213011031 is 13011031222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22213011031 - 223 = 22204622423 is a prime.
It is a super-2 number, since 2×222130110312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22213010996 and 22213011014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22213011061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11106505515 + 11106505516.
It is an arithmetic number, because the mean of its divisors is an integer number (11106505516).
Almost surely, 222213011031 is an apocalyptic number.
22213011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
22213011031 is an equidigital number, since it uses as much as digits as its factorization.
22213011031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 22213011031 its reverse (13011031222), we get a palindrome (35224042253).
It can be divided in two parts, 222 and 13011031, that multiplied together give a palindrome (2888448882).
The spelling of 22213011031 in words is "twenty-two billion, two hundred thirteen million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •