Base | Representation |
---|---|
bin | 10010101000011010… |
… | …10110000101100000 |
3 | 221211002212202222202 |
4 | 21110031112011200 |
5 | 130441144002242 |
6 | 4332320552332 |
7 | 502606465163 |
oct | 112415260540 |
9 | 27732782882 |
10 | 10002719072 |
11 | 4273301985 |
12 | 1b31a826a8 |
13 | c3542cca8 |
14 | 6ac66dada |
15 | 3d8248932 |
hex | 254356160 |
10002719072 has 24 divisors (see below), whose sum is σ = 19706085000. Its totient is φ = 4997999104.
The previous prime is 10002719003. The next prime is 10002719101. The reversal of 10002719072 is 27091720001.
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 3 ways as a sum of consecutive naturals, for example, 56297 + ... + 152232.
It is an arithmetic number, because the mean of its divisors is an integer number (821086875).
Almost surely, 210002719072 is an apocalyptic number.
It is an amenable number.
10002719072 is a deficient number, since it is larger than the sum of its proper divisors (9703365928).
10002719072 is a wasteful number, since it uses less digits than its factorization.
10002719072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210038 (or 210030 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 29.
The spelling of 10002719072 in words is "ten billion, two million, seven hundred nineteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •