Base | Representation |
---|---|
bin | 11101110000000010001… |
… | …11101110101101111111 |
3 | 10121201112100012012102221 |
4 | 32320001013232231333 |
5 | 113222002040120111 |
6 | 2101334000030211 |
7 | 133565406210001 |
oct | 16700107565577 |
9 | 3551470165387 |
10 | 1022221020031 |
11 | 364581131162 |
12 | 146143902367 |
13 | 75519b545c3 |
14 | 376936bc371 |
15 | 1b8cc4a2371 |
hex | ee011eeb7f |
1022221020031 has 2 divisors, whose sum is σ = 1022221020032. Its totient is φ = 1022221020030.
The previous prime is 1022221020013. The next prime is 1022221020077. The reversal of 1022221020031 is 1300201222201.
It is a happy number.
Together with previous prime (1022221020013) 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 1022221020031 - 27 = 1022221019903 is a prime.
It is a super-2 number, since 2×10222210200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022221019987 and 1022221020014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022221024031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511110510015 + 511110510016.
It is an arithmetic number, because the mean of its divisors is an integer number (511110510016).
Almost surely, 21022221020031 is an apocalyptic number.
1022221020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022221020031 is an equidigital number, since it uses as much as digits as its factorization.
1022221020031 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 1022221020031 its reverse (1300201222201), we get a palindrome (2322422242232).
The spelling of 1022221020031 in words is "one trillion, twenty-two billion, two hundred twenty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •