Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …100111100011011010001 |
3 | 21010011110002110222122112 |
4 | 131100003330330123101 |
5 | 230413201404033241 |
6 | 4135233210515105 |
7 | 265140265414652 |
oct | 35200374743321 |
9 | 7104402428575 |
10 | 2010111002321 |
11 | 705535291554 |
12 | 2856a6135a95 |
13 | 117725248196 |
14 | 6d40b669529 |
15 | 3744a9b51eb |
hex | 1d403f3c6d1 |
2010111002321 has 2 divisors, whose sum is σ = 2010111002322. Its totient is φ = 2010111002320.
The previous prime is 2010111002303. The next prime is 2010111002401. The reversal of 2010111002321 is 1232001110102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1030298081296 + 979812921025 = 1015036^2 + 989855^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010111002321 - 214 = 2010110985937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010111002296 and 2010111002305.
It is not a weakly prime, because it can be changed into another prime (2010111002021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005055501160 + 1005055501161.
It is an arithmetic number, because the mean of its divisors is an integer number (1005055501161).
Almost surely, 22010111002321 is an apocalyptic number.
It is an amenable number.
2010111002321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010111002321 is an equidigital number, since it uses as much as digits as its factorization.
2010111002321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 2010111002321 its reverse (1232001110102), we get a palindrome (3242112112423).
The spelling of 2010111002321 in words is "two trillion, ten billion, one hundred eleven million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •