Base | Representation |
---|---|
bin | 111111011101001001… |
… | …1000100010010111000 |
3 | 111000201212012012211102 |
4 | 1332322103010102320 |
5 | 4213040000443210 |
6 | 142333521150532 |
7 | 12562613015051 |
oct | 1767223042270 |
9 | 430655165742 |
10 | 136269546680 |
11 | 52878674373 |
12 | 224b048b448 |
13 | cb08a67c77 |
14 | 684a001728 |
15 | 3828491ea5 |
hex | 1fba4c44b8 |
136269546680 has 64 divisors (see below), whose sum is σ = 314353781280. Its totient is φ = 53132800000.
The previous prime is 136269546667. The next prime is 136269546683. The reversal of 136269546680 is 86645962631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136269546683) by changing a digit.
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, 1911680 + ... + 1981680.
Almost surely, 2136269546680 is an apocalyptic number.
136269546680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136269546680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157176890640).
136269546680 is an abundant number, since it is smaller than the sum of its proper divisors (178084234600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136269546680 is a wasteful number, since it uses less digits than its factorization.
136269546680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71240 (or 71236 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 56.
The spelling of 136269546680 in words is "one hundred thirty-six billion, two hundred sixty-nine million, five hundred forty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •