Base | Representation |
---|---|
bin | 11110111011110101010100… |
… | …000010011011001001001000 |
3 | 122211201112210200210021200201 |
4 | 132323311110002123021020 |
5 | 120313043211233111000 |
6 | 1201205532021341544 |
7 | 40441340243001145 |
oct | 3673652402331110 |
9 | 584645720707621 |
10 | 136053088957000 |
11 | 3a394877901856 |
12 | 133140002678b4 |
13 | 5abb99c6144b7 |
14 | 258500ca3d3cc |
15 | 10ae0be18c96a |
hex | 7bbd5409b248 |
136053088957000 has 32 divisors (see below), whose sum is σ = 318364228161720. Its totient is φ = 54421235582400.
The previous prime is 136053088956989. The next prime is 136053088957007. The reversal of 136053088957000 is 759880350631.
It can be written as a sum of positive squares in 4 ways, for example, as 65810352320164 + 70242736636836 = 8112358^2 + 8381094^2 .
It is not an unprimeable number, because it can be changed into a prime (136053088957007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68026543479 + ... + 68026545478.
Almost surely, 2136053088957000 is an apocalyptic number.
136053088957000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136053088957000 is an abundant number, since it is smaller than the sum of its proper divisors (182311139204720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136053088957000 is a wasteful number, since it uses less digits than its factorization.
136053088957000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136053088978 (or 136053088964 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 136053088957000 in words is "one hundred thirty-six trillion, fifty-three billion, eighty-eight million, nine hundred fifty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •