Base | Representation |
---|---|
bin | 11111000000111000100011… |
… | …011001000000000001010100 |
3 | 122212221201200000212022201220 |
4 | 133000320203121000001110 |
5 | 120334240014234030422 |
6 | 1202033212032450340 |
7 | 40505405150622210 |
oct | 3700704331000124 |
9 | 585851600768656 |
10 | 136400165142612 |
11 | 3a508a92307078 |
12 | 1336b3233a99b0 |
13 | 5b15632524727 |
14 | 2597b3605b940 |
15 | 10b813469ae5c |
hex | 7c0e23640054 |
136400165142612 has 96 divisors (see below), whose sum is σ = 385785979020288. Its totient is φ = 36616550198784.
The previous prime is 136400165142599. The next prime is 136400165142677. The reversal of 136400165142612 is 216241561004631.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 80523198 + ... + 82199669.
It is an arithmetic number, because the mean of its divisors is an integer number (4018603948128).
Almost surely, 2136400165142612 is an apocalyptic number.
136400165142612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136400165142612 is an abundant number, since it is smaller than the sum of its proper divisors (249385813877676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136400165142612 is a wasteful number, since it uses less digits than its factorization.
136400165142612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162723485 (or 162723483 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 136400165142612 in words is "one hundred thirty-six trillion, four hundred billion, one hundred sixty-five million, one hundred forty-two thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •