Base | Representation |
---|---|
bin | 11110111011111101101010… |
… | …011001110111100000100000 |
3 | 122211202101221111100120001110 |
4 | 132323331222121313200200 |
5 | 120313220041324321330 |
6 | 1201214013400303320 |
7 | 40442105353523610 |
oct | 3673755231674040 |
9 | 584671844316043 |
10 | 136062054135840 |
11 | 3a39865847a368 |
12 | 133158a2771b40 |
13 | 5abc79aac2251 |
14 | 258561d58ca40 |
15 | 10ae44628bdb0 |
hex | 7bbf6a677820 |
136062054135840 has 192 divisors, whose sum is σ = 501770307467520. Its totient is φ = 30341363957760.
The previous prime is 136062054135809. The next prime is 136062054135893. The reversal of 136062054135840 is 48531450260631.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 136062054135840.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 493699545 + ... + 493975064.
It is an arithmetic number, because the mean of its divisors is an integer number (2613387018060).
Almost surely, 2136062054135840 is an apocalyptic number.
136062054135840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136062054135840 is an abundant number, since it is smaller than the sum of its proper divisors (365708253331680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136062054135840 is a wasteful number, since it uses less digits than its factorization.
136062054135840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987674675 (or 987674667 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 136062054135840 in words is "one hundred thirty-six trillion, sixty-two billion, fifty-four million, one hundred thirty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •