Base | Representation |
---|---|
bin | 111111011000001110… |
… | …0001010101111100110 |
3 | 111000022022222201021100 |
4 | 1332300130022233212 |
5 | 4212220131111410 |
6 | 142305252300530 |
7 | 12555534162603 |
oct | 1766034125746 |
9 | 430268881240 |
10 | 136104160230 |
11 | 527a3283055 |
12 | 22465011746 |
13 | cab070c86c |
14 | 683206d6aa |
15 | 3818bc38c0 |
hex | 1fb070abe6 |
136104160230 has 96 divisors (see below), whose sum is σ = 355334563584. Its totient is φ = 36144615168.
The previous prime is 136104160177. The next prime is 136104160237. The reversal of 136104160230 is 32061401631.
136104160230 is a `hidden beast` number, since 1 + 3 + 6 + 10 + 41 + 602 + 3 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 136104160194 and 136104160203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136104160237) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26752747 + ... + 26757833.
It is an arithmetic number, because the mean of its divisors is an integer number (3701401704).
Almost surely, 2136104160230 is an apocalyptic number.
136104160230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136104160230 is an abundant number, since it is smaller than the sum of its proper divisors (219230403354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136104160230 is a wasteful number, since it uses less digits than its factorization.
136104160230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6270 (or 6267 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 136104160230 its reverse (32061401631), we get a palindrome (168165561861).
The spelling of 136104160230 in words is "one hundred thirty-six billion, one hundred four million, one hundred sixty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •