Base | Representation |
---|---|
bin | 11101000111100100111… |
… | …101100000100110101111 |
3 | 21002021221012122010110221 |
4 | 131013210331200212233 |
5 | 230241022241402343 |
6 | 4131125222312211 |
7 | 264365446621525 |
oct | 35074475404657 |
9 | 7067835563427 |
10 | 2001001122223 |
11 | 70168aa70824 |
12 | 283983288667 |
13 | 116902aa529c |
14 | 6cbc5810315 |
15 | 370b5d315ed |
hex | 1d1e4f609af |
2001001122223 has 2 divisors, whose sum is σ = 2001001122224. Its totient is φ = 2001001122222.
The previous prime is 2001001122161. The next prime is 2001001122227. The reversal of 2001001122223 is 3222211001002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2001001122223 - 221 = 2000999025071 is a prime.
It is a super-2 number, since 2×20010011222232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001001122197 and 2001001122206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001001122227) 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, 1000500561111 + 1000500561112.
It is an arithmetic number, because the mean of its divisors is an integer number (1000500561112).
Almost surely, 22001001122223 is an apocalyptic number.
2001001122223 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001001122223 is an equidigital number, since it uses as much as digits as its factorization.
2001001122223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2001001122223 its reverse (3222211001002), we get a palindrome (5223212123225).
The spelling of 2001001122223 in words is "two trillion, one billion, one million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •