Base | Representation |
---|---|
bin | 1000111100101100… |
… | …0101010101000000 |
3 | 20012101212122102200 |
4 | 2033023011111000 |
5 | 14404411003141 |
6 | 1034204113200 |
7 | 113345031225 |
oct | 21713052500 |
9 | 6171778380 |
10 | 2402047296 |
11 | 1022990760 |
12 | 570535800 |
13 | 2c385477c |
14 | 18b03394c |
15 | e0d2cab6 |
hex | 8f2c5540 |
2402047296 has 168 divisors, whose sum is σ = 7538703744. Its totient is φ = 725207040.
The previous prime is 2402047237. The next prime is 2402047303. The reversal of 2402047296 is 6927402042.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2402047296.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2324796 + ... + 2325828.
Almost surely, 22402047296 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2402047296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3769351872).
2402047296 is an abundant number, since it is smaller than the sum of its proper divisors (5136656448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2402047296 is a wasteful number, since it uses less digits than its factorization.
2402047296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429 (or 1416 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 2402047296 is about 49010.6855287702. The cubic root of 2402047296 is about 1339.2464940201.
The spelling of 2402047296 in words is "two billion, four hundred two million, forty-seven thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •