Base | Representation |
---|---|
bin | 111011101110010… |
… | …1101011111111110 |
3 | 12011122220111220120 |
4 | 1313130231133332 |
5 | 13101011440402 |
6 | 530504555410 |
7 | 100442563425 |
oct | 16734553776 |
9 | 5148814816 |
10 | 2004015102 |
11 | 93923a231 |
12 | 47b182b66 |
13 | 25c251a6b |
14 | 1502222bc |
15 | bae073bc |
hex | 7772d7fe |
2004015102 has 8 divisors (see below), whose sum is σ = 4008030216. Its totient is φ = 668005032.
The previous prime is 2004015077. The next prime is 2004015103. The reversal of 2004015102 is 2015104002.
It is a sphenic number, since it is the product of 3 distinct primes.
2004015102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004015103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167001253 + ... + 167001264.
It is an arithmetic number, because the mean of its divisors is an integer number (501003777).
Almost surely, 22004015102 is an apocalyptic number.
2004015102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2004015102 is a wasteful number, since it uses less digits than its factorization.
2004015102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334002522.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 2004015102 is about 44766.2272477813. The cubic root of 2004015102 is about 1260.7636049100.
Adding to 2004015102 its reverse (2015104002), we get a palindrome (4019119104).
Subtracting 2004015102 from its reverse (2015104002), we obtain a square (11088900 = 33302).
The spelling of 2004015102 in words is "two billion, four million, fifteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •