Base | Representation |
---|---|
bin | 101110110111111100… |
… | …1001011000000111110 |
3 | 100121211021101100001000 |
4 | 1131233321023000332 |
5 | 3122123321143420 |
6 | 114124313231130 |
7 | 10162325453514 |
oct | 1355771130076 |
9 | 317737340030 |
10 | 100661506110 |
11 | 39765883470 |
12 | 176134024a6 |
13 | 9652891989 |
14 | 4c2cc584b4 |
15 | 2942356690 |
hex | 176fe4b03e |
100661506110 has 128 divisors (see below), whose sum is σ = 292996984320. Its totient is φ = 24389164800.
The previous prime is 100661506109. The next prime is 100661506177. The reversal of 100661506110 is 11605166001.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5940450 + ... + 5957370.
It is an arithmetic number, because the mean of its divisors is an integer number (2289038940).
Almost surely, 2100661506110 is an apocalyptic number.
100661506110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 100661506110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146498492160).
100661506110 is an abundant number, since it is smaller than the sum of its proper divisors (192335478210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100661506110 is a wasteful number, since it uses less digits than its factorization.
100661506110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18951 (or 18945 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 100661506110 in words is "one hundred billion, six hundred sixty-one million, five hundred six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •