Base | Representation |
---|---|
bin | 111111101101010101… |
… | …0100010010011001000 |
3 | 111002010200222122111211 |
4 | 1333122222202103020 |
5 | 4220143004213200 |
6 | 142503440102504 |
7 | 12612225440614 |
oct | 1773252422310 |
9 | 432120878454 |
10 | 136812569800 |
11 | 53027146705 |
12 | 22622304a34 |
13 | cb9440491a |
14 | 689c196344 |
15 | 385aea7aba |
hex | 1fdaaa24c8 |
136812569800 has 96 divisors (see below), whose sum is σ = 332989937280. Its totient is φ = 52176819200.
The previous prime is 136812569779. The next prime is 136812569833. The reversal of 136812569800 is 8965218631.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1382784 + ... + 1478416.
It is an arithmetic number, because the mean of its divisors is an integer number (3468645180).
Almost surely, 2136812569800 is an apocalyptic number.
136812569800 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 136812569800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166494968640).
136812569800 is an abundant number, since it is smaller than the sum of its proper divisors (196177367480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136812569800 is a wasteful number, since it uses less digits than its factorization.
136812569800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95983 (or 95974 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 49.
The spelling of 136812569800 in words is "one hundred thirty-six billion, eight hundred twelve million, five hundred sixty-nine thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •