Base | Representation |
---|---|
bin | 100000010011101010001… |
… | …111010111000101111111 |
3 | 21212020112212221220220001 |
4 | 200103222033113011333 |
5 | 242333313023120111 |
6 | 4415525351335131 |
7 | 316253652205333 |
oct | 40235217270577 |
9 | 7766485856801 |
10 | 2220133020031 |
11 | 78660a235a13 |
12 | 2ba33a0814a7 |
13 | 131485993444 |
14 | 796527a17c3 |
15 | 3cb3dbe61c1 |
hex | 204ea3d717f |
2220133020031 has 2 divisors, whose sum is σ = 2220133020032. Its totient is φ = 2220133020030.
The previous prime is 2220133019911. The next prime is 2220133020211. The reversal of 2220133020031 is 1300203310222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220133020031 - 27 = 2220133019903 is a prime.
It is a super-2 number, since 2×22201330200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220133019990 and 2220133020008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220133420031) 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, 1110066510015 + 1110066510016.
It is an arithmetic number, because the mean of its divisors is an integer number (1110066510016).
Almost surely, 22220133020031 is an apocalyptic number.
2220133020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220133020031 is an equidigital number, since it uses as much as digits as its factorization.
2220133020031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2220133020031 its reverse (1300203310222), we get a palindrome (3520336330253).
The spelling of 2220133020031 in words is "two trillion, two hundred twenty billion, one hundred thirty-three million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •