Base | Representation |
---|---|
bin | 111111011010000101… |
… | …1100010001111000000 |
3 | 111000110201001200012211 |
4 | 1332310023202033000 |
5 | 4212332212040424 |
6 | 142315413231504 |
7 | 12560225425330 |
oct | 1766413421700 |
9 | 430421050184 |
10 | 136166908864 |
11 | 52825741028 |
12 | 22482032594 |
13 | cac070c92c |
14 | 683a5250c0 |
15 | 381e46ab94 |
hex | 1fb42e23c0 |
136166908864 has 112 divisors (see below), whose sum is σ = 313642816960. Its totient is φ = 57450332160.
The previous prime is 136166908859. The next prime is 136166908957. The reversal of 136166908864 is 468809661631.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 136166908799 and 136166908808.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7657744 + ... + 7675504.
Almost surely, 2136166908864 is an apocalyptic number.
136166908864 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136166908864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156821408480).
136166908864 is an abundant number, since it is smaller than the sum of its proper divisors (177475908096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136166908864 is a wasteful number, since it uses less digits than its factorization.
136166908864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18046 (or 18036 counting only the distinct ones).
The product of its (nonzero) digits is 8957952, while the sum is 58.
The spelling of 136166908864 in words is "one hundred thirty-six billion, one hundred sixty-six million, nine hundred eight thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •