Base | Representation |
---|---|
bin | 110010100000010001011000… |
… | …111000111011110111100111 |
3 | 1002010110110121002202010211222 |
4 | 302200101120320323313213 |
5 | 213103203300110001411 |
6 | 2104224310053450555 |
7 | 64533433106116553 |
oct | 6240213070736747 |
9 | 1063413532663758 |
10 | 222120020000231 |
11 | 648576316a6801 |
12 | 20ab4421340a5b |
13 | 96c2a9c1a48a2 |
14 | 3cbc9485a2863 |
15 | 1aa2cb8a094db |
hex | ca0458e3bde7 |
222120020000231 has 2 divisors, whose sum is σ = 222120020000232. Its totient is φ = 222120020000230.
The previous prime is 222120020000069. The next prime is 222120020000233. The reversal of 222120020000231 is 132000020021222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222120020000231 - 222 = 222120015805927 is a prime.
It is a super-2 number, since 2×2221200200002312 (a number of 29 digits) contains 22 as substring.
Together with 222120020000233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222120020000233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111060010000115 + 111060010000116.
It is an arithmetic number, because the mean of its divisors is an integer number (111060010000116).
Almost surely, 2222120020000231 is an apocalyptic number.
222120020000231 is a deficient number, since it is larger than the sum of its proper divisors (1).
222120020000231 is an equidigital number, since it uses as much as digits as its factorization.
222120020000231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 222120020000231 its reverse (132000020021222), we get a palindrome (354120040021453).
The spelling of 222120020000231 in words is "two hundred twenty-two trillion, one hundred twenty billion, twenty million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •