Base | Representation |
---|---|
bin | 101111001000001100… |
… | …0101111110010111000 |
3 | 100200020021011201112122 |
4 | 1132100120233302320 |
5 | 3124232400413021 |
6 | 114254345500412 |
7 | 10211665236410 |
oct | 1362030576270 |
9 | 320207151478 |
10 | 101206654136 |
11 | 39a15577225 |
12 | 17745aa1708 |
13 | 970b7c3883 |
14 | 4c81403640 |
15 | 297513bbab |
hex | 179062fcb8 |
101206654136 has 64 divisors (see below), whose sum is σ = 221312191680. Its totient is φ = 42488709120.
The previous prime is 101206654127. The next prime is 101206654147. The reversal of 101206654136 is 631456602101.
It is a junction number, because it is equal to n+sod(n) for n = 101206654096 and 101206654105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1875890 + ... + 1929086.
It is an arithmetic number, because the mean of its divisors is an integer number (3458002995).
Almost surely, 2101206654136 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 101206654136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110656095840).
101206654136 is an abundant number, since it is smaller than the sum of its proper divisors (120105537544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101206654136 is a wasteful number, since it uses less digits than its factorization.
101206654136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53904 (or 53900 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 101206654136 in words is "one hundred one billion, two hundred six million, six hundred fifty-four thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •