Base | Representation |
---|---|
bin | 110010100001100111111111… |
… | …100110100110001100001011 |
3 | 1002010210100121211021200101112 |
4 | 302201213333212212030023 |
5 | 213111214221343114011 |
6 | 2104335125332040535 |
7 | 64543234400125154 |
oct | 6241477746461413 |
9 | 1063710554250345 |
10 | 222213011301131 |
11 | 648930108864a4 |
12 | 20b0a453a6314b |
13 | 96cb79b9539a6 |
14 | 3cc324a88092b |
15 | 1aa540c7ac58b |
hex | ca19ff9a630b |
222213011301131 has 2 divisors, whose sum is σ = 222213011301132. Its totient is φ = 222213011301130.
The previous prime is 222213011301101. The next prime is 222213011301173. The reversal of 222213011301131 is 131103110312222.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222213011301131 is a prime.
It is a super-2 number, since 2×2222130113011312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222213011301097 and 222213011301106.
It is not a weakly prime, because it can be changed into another prime (222213011301101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111106505650565 + 111106505650566.
It is an arithmetic number, because the mean of its divisors is an integer number (111106505650566).
Almost surely, 2222213011301131 is an apocalyptic number.
222213011301131 is a deficient number, since it is larger than the sum of its proper divisors (1).
222213011301131 is an equidigital number, since it uses as much as digits as its factorization.
222213011301131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 222213011301131 its reverse (131103110312222), we get a palindrome (353316121613353).
The spelling of 222213011301131 in words is "two hundred twenty-two trillion, two hundred thirteen billion, eleven million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •