Base | Representation |
---|---|
bin | 11101001111111101010… |
… | …110101110011101001011 |
3 | 21010011011101012202111120 |
4 | 131033331112232131023 |
5 | 230412440040222311 |
6 | 4135214214330323 |
7 | 265134452552643 |
oct | 35177526563513 |
9 | 7104141182446 |
10 | 2010000320331 |
11 | 705488864533 |
12 | 2856750599a3 |
13 | 117708334593 |
14 | 6d3daa97523 |
15 | 37440e00706 |
hex | 1d3fd5ae74b |
2010000320331 has 16 divisors (see below), whose sum is σ = 2695664801280. Its totient is φ = 1332189754560.
The previous prime is 2010000320329. The next prime is 2010000320333. The reversal of 2010000320331 is 1330230000102.
It is an interprime number because it is at equal distance from previous prime (2010000320329) and next prime (2010000320333).
It is not a de Polignac number, because 2010000320331 - 21 = 2010000320329 is a prime.
It is a super-2 number, since 2×20100003203312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2010000320331.
It is not an unprimeable number, because it can be changed into a prime (2010000320333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2345575 + ... + 3085728.
It is an arithmetic number, because the mean of its divisors is an integer number (168479050080).
Almost surely, 22010000320331 is an apocalyptic number.
2010000320331 is a deficient number, since it is larger than the sum of its proper divisors (685664480949).
2010000320331 is a wasteful number, since it uses less digits than its factorization.
2010000320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5432026.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2010000320331 its reverse (1330230000102), we get a palindrome (3340230320433).
The spelling of 2010000320331 in words is "two trillion, ten billion, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •