Base | Representation |
---|---|
bin | 111111101010000001… |
… | …1001110100101110000 |
3 | 111001211222011220112020 |
4 | 1333110003032211300 |
5 | 4214431102232120 |
6 | 142444433431440 |
7 | 12606410306034 |
oct | 1772403164560 |
9 | 431758156466 |
10 | 136701602160 |
11 | 52a7a544012 |
12 | 225b110b580 |
13 | cb77420cb6 |
14 | 688b54c1c4 |
15 | 3851388640 |
hex | 1fd40ce970 |
136701602160 has 80 divisors (see below), whose sum is σ = 442199983104. Its totient is φ = 34868813056.
The previous prime is 136701602129. The next prime is 136701602171. The reversal of 136701602160 is 61206107631.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1367016021602 (a number of 23 digits) contains 22 as substring.
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, 12376872 + ... + 12387911.
Almost surely, 2136701602160 is an apocalyptic number.
136701602160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136701602160 is an abundant number, since it is smaller than the sum of its proper divisors (305498380944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136701602160 is a wasteful number, since it uses less digits than its factorization.
136701602160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24764822 (or 24764816 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
Adding to 136701602160 its reverse (61206107631), we get a palindrome (197907709791).
The spelling of 136701602160 in words is "one hundred thirty-six billion, seven hundred one million, six hundred two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •