Base | Representation |
---|---|
bin | 101110100111000011… |
… | …0111000000001100000 |
3 | 100120100202210020011211 |
4 | 1131032012320001200 |
5 | 3114443214013432 |
6 | 113552144115504 |
7 | 10142303453026 |
oct | 1351606700140 |
9 | 316322706154 |
10 | 100094672992 |
11 | 394a4919346 |
12 | 17495605b94 |
13 | 9592309672 |
14 | 4bb7866716 |
15 | 290c6dad47 |
hex | 174e1b8060 |
100094672992 has 192 divisors, whose sum is σ = 217349153280. Its totient is φ = 45226266624.
The previous prime is 100094672959. The next prime is 100094673011. The reversal of 100094672992 is 299276490001.
It is a super-2 number, since 2×1000946729922 (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 31 ways as a sum of consecutive naturals, for example, 353691283 + ... + 353691565.
It is an arithmetic number, because the mean of its divisors is an integer number (1132026840).
Almost surely, 2100094672992 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 100094672992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108674576640).
100094672992 is an abundant number, since it is smaller than the sum of its proper divisors (117254480288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100094672992 is a wasteful number, since it uses less digits than its factorization.
100094672992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645 (or 637 counting only the distinct ones).
The product of its (nonzero) digits is 489888, while the sum is 49.
The spelling of 100094672992 in words is "one hundred billion, ninety-four million, six hundred seventy-two thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •