Base | Representation |
---|---|
bin | 110010100011010110001011… |
… | …101001100010110110101011 |
3 | 1002011012200000022101101011102 |
4 | 302203112023221202312223 |
5 | 213120134023200014011 |
6 | 2104505333425152015 |
7 | 64554623332025063 |
oct | 6243261351426653 |
9 | 1064180008341142 |
10 | 222331325001131 |
11 | 64929204885455 |
12 | 20b29372a8b60b |
13 | 97099a567a4b8 |
14 | 3cc8c71c6a3a3 |
15 | 1aa85346b873b |
hex | ca358ba62dab |
222331325001131 has 2 divisors, whose sum is σ = 222331325001132. Its totient is φ = 222331325001130.
The previous prime is 222331325001017. The next prime is 222331325001139. The reversal of 222331325001131 is 131100523133222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222331325001131 - 210 = 222331325000107 is a prime.
It is a super-2 number, since 2×2223313250011312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222331325001094 and 222331325001103.
It is not a weakly prime, because it can be changed into another prime (222331325001139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111165662500565 + 111165662500566.
It is an arithmetic number, because the mean of its divisors is an integer number (111165662500566).
Almost surely, 2222331325001131 is an apocalyptic number.
222331325001131 is a deficient number, since it is larger than the sum of its proper divisors (1).
222331325001131 is an equidigital number, since it uses as much as digits as its factorization.
222331325001131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 222331325001131 its reverse (131100523133222), we get a palindrome (353431848134353).
The spelling of 222331325001131 in words is "two hundred twenty-two trillion, three hundred thirty-one billion, three hundred twenty-five million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •