Base | Representation |
---|---|
bin | 11101010000000101001… |
… | …010000000000100010011 |
3 | 21010011111111111020211202 |
4 | 131100011022000010103 |
5 | 230413222041433243 |
6 | 4135235211501415 |
7 | 265140632206046 |
oct | 35200512000423 |
9 | 7104444436752 |
10 | 2010131202323 |
11 | 705545729072 |
12 | 2856b0a5786b |
13 | 11772949b64a |
14 | 6d410206c5d |
15 | 3744c6554b8 |
hex | 1d405280113 |
2010131202323 has 8 divisors (see below), whose sum is σ = 2013769964640. Its totient is φ = 2006495400960.
The previous prime is 2010131202241. The next prime is 2010131202329. The reversal of 2010131202323 is 3232021310102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010131202323 - 28 = 2010131202067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010131202295 and 2010131202304.
It is not an unprimeable number, because it can be changed into a prime (2010131202329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 621011 + ... + 2099027.
It is an arithmetic number, because the mean of its divisors is an integer number (251721245580).
Almost surely, 22010131202323 is an apocalyptic number.
2010131202323 is a deficient number, since it is larger than the sum of its proper divisors (3638762317).
2010131202323 is a wasteful number, since it uses less digits than its factorization.
2010131202323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480477.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2010131202323 its reverse (3232021310102), we get a palindrome (5242152512425).
The spelling of 2010131202323 in words is "two trillion, ten billion, one hundred thirty-one million, two hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •