Base | Representation |
---|---|
bin | 11101010000010110100… |
… | …011111001010110100001 |
3 | 21010012020211221102210021 |
4 | 131100112203321112201 |
5 | 230414321320000413 |
6 | 4135324202233441 |
7 | 265151106161464 |
oct | 35202643712641 |
9 | 7105224842707 |
10 | 2010423203233 |
11 | 705685539735 |
12 | 2857727b5881 |
13 | 117774b28553 |
14 | 6d43acd72db |
15 | 374680d418d |
hex | 1d4168f95a1 |
2010423203233 has 2 divisors, whose sum is σ = 2010423203234. Its totient is φ = 2010423203232.
The previous prime is 2010423203231. The next prime is 2010423203251. The reversal of 2010423203233 is 3323023240102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1701490665744 + 308932537489 = 1304412^2 + 555817^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010423203233 - 21 = 2010423203231 is a prime.
Together with 2010423203231, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2010423203198 and 2010423203207.
It is not a weakly prime, because it can be changed into another prime (2010423203231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005211601616 + 1005211601617.
It is an arithmetic number, because the mean of its divisors is an integer number (1005211601617).
Almost surely, 22010423203233 is an apocalyptic number.
It is an amenable number.
2010423203233 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010423203233 is an equidigital number, since it uses as much as digits as its factorization.
2010423203233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 2010423203233 its reverse (3323023240102), we get a palindrome (5333446443335).
The spelling of 2010423203233 in words is "two trillion, ten billion, four hundred twenty-three million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •