Base | Representation |
---|---|
bin | 101111011111111111… |
… | …0011101101111010100 |
3 | 100202021220112111022100 |
4 | 1132333332131233110 |
5 | 3132401244231204 |
6 | 114505510402100 |
7 | 10240531536660 |
oct | 1367776355724 |
9 | 322256474270 |
10 | 102005070804 |
11 | 3a29522650a |
12 | 17929360330 |
13 | 9808040b80 |
14 | 4d194798a0 |
15 | 29c029ea39 |
hex | 17bff9dbd4 |
102005070804 has 144 divisors (see below), whose sum is σ = 317607017728. Its totient is φ = 26880574464.
The previous prime is 102005070773. The next prime is 102005070809. The reversal of 102005070804 is 408070500201.
102005070804 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102005070809) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4236969 + ... + 4260975.
Almost surely, 2102005070804 is an apocalyptic number.
102005070804 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102005070804, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158803508864).
102005070804 is an abundant number, since it is smaller than the sum of its proper divisors (215601946924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102005070804 is a wasteful number, since it uses less digits than its factorization.
102005070804 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25334 (or 25329 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The spelling of 102005070804 in words is "one hundred two billion, five million, seventy thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •