Base | Representation |
---|---|
bin | 11101010000010001001… |
… | …100101000110111101011 |
3 | 21010012000120121211110012 |
4 | 131100101030220313223 |
5 | 230414130301022311 |
6 | 4135311225442135 |
7 | 265145634266612 |
oct | 35202114506753 |
9 | 7105016554405 |
10 | 2010333220331 |
11 | 70563976a1a7 |
12 | 28574864034b |
13 | 11775c2b1327 |
14 | 6d42cd92879 |
15 | 3746025c78b |
hex | 1d411328deb |
2010333220331 has 2 divisors, whose sum is σ = 2010333220332. Its totient is φ = 2010333220330.
The previous prime is 2010333220319. The next prime is 2010333220333. The reversal of 2010333220331 is 1330223330102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2010333220331 - 218 = 2010332958187 is a prime.
It is a super-2 number, since 2×20103332203312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 2010333220333, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010333220297 and 2010333220306.
It is not a weakly prime, because it can be changed into another prime (2010333220333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005166610165 + 1005166610166.
It is an arithmetic number, because the mean of its divisors is an integer number (1005166610166).
Almost surely, 22010333220331 is an apocalyptic number.
2010333220331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010333220331 is an equidigital number, since it uses as much as digits as its factorization.
2010333220331 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 2010333220331 its reverse (1330223330102), we get a palindrome (3340556550433).
The spelling of 2010333220331 in words is "two trillion, ten billion, three hundred thirty-three million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •