Base | Representation |
---|---|
bin | 111011111001110… |
… | …0010101010011110 |
3 | 12012002011120200120 |
4 | 1313303202222132 |
5 | 13104030000110 |
6 | 531241135410 |
7 | 100544501253 |
oct | 16763425236 |
9 | 5162146616 |
10 | 2010000030 |
11 | 941657855 |
12 | 48118a566 |
13 | 260568c3c |
14 | 150d3d42a |
15 | bb6da870 |
hex | 77ce2a9e |
2010000030 has 32 divisors (see below), whose sum is σ = 4878208800. Its totient is φ = 529976832.
The previous prime is 2010000001. The next prime is 2010000059. The reversal of 2010000030 is 300000102.
It is an interprime number because it is at equal distance from previous prime (2010000001) and next prime (2010000059).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a junction number, because it is equal to n+sod(n) for n = 2009999973 and 2010000018.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 373735 + ... + 379074.
It is an arithmetic number, because the mean of its divisors is an integer number (152444025).
Almost surely, 22010000030 is an apocalyptic number.
2010000030 is an abundant number, since it is smaller than the sum of its proper divisors (2868208770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010000030 is a wasteful number, since it uses less digits than its factorization.
2010000030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752908.
The product of its (nonzero) digits is 6, while the sum is 6.
The square root of 2010000030 is about 44833.0238774946. The cubic root of 2010000030 is about 1262.0174344987.
Adding to 2010000030 its reverse (300000102), we get a palindrome (2310000132).
The spelling of 2010000030 in words is "two billion, ten million, thirty", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •