Base | Representation |
---|---|
bin | 111011111001111… |
… | …0001110111111000 |
3 | 12012002021202010220 |
4 | 1313303301313320 |
5 | 13104033443303 |
6 | 531242340040 |
7 | 100545151011 |
oct | 16763616770 |
9 | 5162252126 |
10 | 2010062328 |
11 | 94169a63a |
12 | 4811ba620 |
13 | 26058b3c1 |
14 | 150d58008 |
15 | bb6ee053 |
hex | 77cf1df8 |
2010062328 has 16 divisors (see below), whose sum is σ = 5025155880. Its totient is φ = 670020768.
The previous prime is 2010062323. The next prime is 2010062347. The reversal of 2010062328 is 8232600102.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 83752597 = 2010062328 / (2 + 0 + 1 + 0 + 0 + 6 + 2 + 3 + 2 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 2010062298 and 2010062307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010062323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41876275 + ... + 41876322.
Almost surely, 22010062328 is an apocalyptic number.
It is an amenable number.
2010062328 is an abundant number, since it is smaller than the sum of its proper divisors (3015093552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010062328 is a wasteful number, since it uses less digits than its factorization.
2010062328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83752606 (or 83752602 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 2010062328 is about 44833.7186501410. The cubic root of 2010062328 is about 1262.0304726991.
It can be divided in two parts, 20100 and 62328, that added together give a palindrome (82428).
The spelling of 2010062328 in words is "two billion, ten million, sixty-two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •