Base | Representation |
---|---|
bin | 101111000011110100… |
… | …1010100110011111100 |
3 | 100122212001020011220110 |
4 | 1132013221110303330 |
5 | 3123432330130431 |
6 | 114232030350020 |
7 | 10205234604300 |
oct | 1360751246374 |
9 | 318761204813 |
10 | 101060005116 |
11 | 3994a813694 |
12 | 1770495b310 |
13 | 96b72c8cc5 |
14 | 4c69b4bd00 |
15 | 2967320346 |
hex | 1787a54cfc |
101060005116 has 72 divisors (see below), whose sum is σ = 275134976256. Its totient is φ = 28786998240.
The previous prime is 101060005091. The next prime is 101060005117. The reversal of 101060005116 is 611500060101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 101060005092 and 101060005101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101060005117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64996 + ... + 454251.
Almost surely, 2101060005116 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 101060005116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137567488128).
101060005116 is an abundant number, since it is smaller than the sum of its proper divisors (174074971140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101060005116 is a wasteful number, since it uses less digits than its factorization.
101060005116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519599 (or 519590 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 101060005116 its reverse (611500060101), we get a palindrome (712560065217).
The spelling of 101060005116 in words is "one hundred one billion, sixty million, five thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •