Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …010010001011101001111 |
3 | 21010011110001011102000212 |
4 | 131100003322101131033 |
5 | 230413201214131111 |
6 | 4135233143513035 |
7 | 265140256440206 |
oct | 35200372213517 |
9 | 7104401142025 |
10 | 2010110302031 |
11 | 7055349533a7 |
12 | 2856a5a5877b |
13 | 117725061500 |
14 | 6d40b52623d |
15 | 3744a8c798b |
hex | 1d403e9174f |
2010110302031 has 6 divisors (see below), whose sum is σ = 2176628315400. Its totient is φ = 1855486432488.
The previous prime is 2010110302021. The next prime is 2010110302087. The reversal of 2010110302031 is 1302030110102.
It is not a de Polignac number, because 2010110302031 - 226 = 2010043193167 is a prime.
It is a super-2 number, since 2×20101103020312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010110301997 and 2010110302015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010110302021) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5947071731 + ... + 5947072068.
It is an arithmetic number, because the mean of its divisors is an integer number (362771385900).
Almost surely, 22010110302031 is an apocalyptic number.
2010110302031 is a deficient number, since it is larger than the sum of its proper divisors (166518013369).
2010110302031 is a wasteful number, since it uses less digits than its factorization.
2010110302031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11894143825 (or 11894143812 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2010110302031 its reverse (1302030110102), we get a palindrome (3312140412133).
The spelling of 2010110302031 in words is "two trillion, ten billion, one hundred ten million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •