Base | Representation |
---|---|
bin | 111111101111111100… |
… | …1100110101001011010 |
3 | 111002100211021011220212 |
4 | 1333133321212221122 |
5 | 4220333000441400 |
6 | 142520254451122 |
7 | 12614343151445 |
oct | 1773771465132 |
9 | 432324234825 |
10 | 136900405850 |
11 | 5307178a18a |
12 | 22647803aa2 |
13 | cba9679910 |
14 | 68a9adc65c |
15 | 3863a58335 |
hex | 1fdfe66a5a |
136900405850 has 96 divisors (see below), whose sum is σ = 300365619120. Its totient is φ = 45933834240.
The previous prime is 136900405847. The next prime is 136900405951. The reversal of 136900405850 is 58504009631.
It can be written as a sum of positive squares in 24 ways, for example, as 14817949441 + 122082456409 = 121729^2 + 349403^2 .
It is a super-2 number, since 2×1369004058502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 136900405798 and 136900405807.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 106844 + ... + 534056.
Almost surely, 2136900405850 is an apocalyptic number.
136900405850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136900405850 is an abundant number, since it is smaller than the sum of its proper divisors (163465213270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136900405850 is a wasteful number, since it uses less digits than its factorization.
136900405850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427284 (or 427279 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 136900405850 in words is "one hundred thirty-six billion, nine hundred million, four hundred five thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •