Base | Representation |
---|---|
bin | 111111100111010011… |
… | …0000100110001000000 |
3 | 111001121120221210000221 |
4 | 1333032212010301000 |
5 | 4214234134324124 |
6 | 142431403552424 |
7 | 12604216316101 |
oct | 1771646046100 |
9 | 431546853027 |
10 | 136610073664 |
11 | 52a32909329 |
12 | 2258652b714 |
13 | cb6148541c |
14 | 687d3243a8 |
15 | 3848308ce4 |
hex | 1fce984c40 |
136610073664 has 63 divisors (see below), whose sum is σ = 277258165447. Its totient is φ = 66783730304.
The previous prime is 136610073659. The next prime is 136610073671. The reversal of 136610073664 is 466370016631.
The square root of 136610073664 is 369608.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136610073664.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 138972117 + ... + 138973099.
Almost surely, 2136610073664 is an apocalyptic number.
136610073664 is the 369608-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136610073664
136610073664 is an abundant number, since it is smaller than the sum of its proper divisors (140648091783).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136610073664 is an frugal number, since it uses more digits than its factorization.
136610073664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2072 (or 1032 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 43.
The spelling of 136610073664 in words is "one hundred thirty-six billion, six hundred ten million, seventy-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •