Base | Representation |
---|---|
bin | 10110110000110011101110… |
… | …100011011110000111101000 |
3 | 111010110112020200120212001100 |
4 | 112300303232203132013220 |
5 | 101110210013100322414 |
6 | 552530223205321400 |
7 | 30041534245512636 |
oct | 2660635643360750 |
9 | 433415220525040 |
10 | 100111100010984 |
11 | 29997974079877 |
12 | b28a250a06260 |
13 | 43b25894c880a |
14 | 1aa1590138356 |
15 | b891bd251609 |
hex | 5b0cee8de1e8 |
100111100010984 has 192 divisors, whose sum is σ = 292371390604800. Its totient is φ = 30851128927872.
The previous prime is 100111100010847. The next prime is 100111100011067. The reversal of 100111100010984 is 489010001111001.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4703229 + ... + 14911155.
It is an arithmetic number, because the mean of its divisors is an integer number (1522767659400).
Almost surely, 2100111100010984 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 100111100010984, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146185695302400).
100111100010984 is an abundant number, since it is smaller than the sum of its proper divisors (192260290593816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111100010984 is a wasteful number, since it uses less digits than its factorization.
100111100010984 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10208132 (or 10208125 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 27.
Adding to 100111100010984 its reverse (489010001111001), we get a palindrome (589121101121985).
The spelling of 100111100010984 in words is "one hundred trillion, one hundred eleven billion, one hundred million, ten thousand, nine hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •