Base | Representation |
---|---|
bin | 101111100011010100… |
… | …0100111111100000000 |
3 | 100202120200202012122020 |
4 | 1133012220213330000 |
5 | 3133113344122140 |
6 | 114524541041440 |
7 | 10243356234012 |
oct | 1370650477400 |
9 | 322520665566 |
10 | 102116785920 |
11 | 3a342299756 |
12 | 1795a856280 |
13 | 9825226aa6 |
14 | 4d2a23a1b2 |
15 | 29c9eba6d0 |
hex | 17c6a27f00 |
102116785920 has 864 divisors, whose sum is σ = 379516838400. Its totient is φ = 23302766592.
The previous prime is 102116785909. The next prime is 102116785933. The reversal of 102116785920 is 29587611201.
It is a super-2 number, since 2×1021167859202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 611477677 + ... + 611477843.
It is an arithmetic number, because the mean of its divisors is an integer number (439255600).
Almost surely, 2102116785920 is an apocalyptic number.
102116785920 is a gapful number since it is divisible by the number (10) 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 102116785920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189758419200).
102116785920 is an abundant number, since it is smaller than the sum of its proper divisors (277400052480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102116785920 is a wasteful number, since it uses less digits than its factorization.
102116785920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273 (or 242 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 42.
The spelling of 102116785920 in words is "one hundred two billion, one hundred sixteen million, seven hundred eighty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •