Base | Representation |
---|---|
bin | 11101000111110010110… |
… | …010110101000010000011 |
3 | 21002022112101100001220112 |
4 | 131013302302311002003 |
5 | 230242011200001311 |
6 | 4131204232501535 |
7 | 264404265363035 |
oct | 35076262650203 |
9 | 7068471301815 |
10 | 2001233203331 |
11 | 701799a7579a |
12 | 283a28b4a8ab |
13 | 11693bbb289b |
14 | 6cc08583c55 |
15 | 370cb3c628b |
hex | 1d1f2cb5083 |
2001233203331 has 2 divisors, whose sum is σ = 2001233203332. Its totient is φ = 2001233203330.
The previous prime is 2001233203313. The next prime is 2001233203339. The reversal of 2001233203331 is 1333023321002.
Together with previous prime (2001233203313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001233203331 is a prime.
It is a super-2 number, since 2×20012332033312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001233203297 and 2001233203306.
It is not a weakly prime, because it can be changed into another prime (2001233203339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000616601665 + 1000616601666.
It is an arithmetic number, because the mean of its divisors is an integer number (1000616601666).
Almost surely, 22001233203331 is an apocalyptic number.
2001233203331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001233203331 is an equidigital number, since it uses as much as digits as its factorization.
2001233203331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 2001233203331 its reverse (1333023321002), we get a palindrome (3334256524333).
The spelling of 2001233203331 in words is "two trillion, one billion, two hundred thirty-three million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •