Base | Representation |
---|---|
bin | 111111101100011011… |
… | …0101101110100101100 |
3 | 111002001120212010100211 |
4 | 1333120312231310230 |
5 | 4220112221131200 |
6 | 142500433232204 |
7 | 12611406405253 |
oct | 1773066556454 |
9 | 432046763324 |
10 | 136782208300 |
11 | 53010a99661 |
12 | 22614102664 |
13 | cb8b03423a |
14 | 689813179a |
15 | 38584ababa |
hex | 1fd8dadd2c |
136782208300 has 72 divisors (see below), whose sum is σ = 307320108032. Its totient is φ = 52787592000.
The previous prime is 136782208247. The next prime is 136782208309. The reversal of 136782208300 is 3802287631.
It is not an unprimeable number, because it can be changed into a prime (136782208309) 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 23 ways as a sum of consecutive naturals, for example, 959449 + ... + 1092751.
Almost surely, 2136782208300 is an apocalyptic number.
136782208300 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 136782208300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153660054016).
136782208300 is an abundant number, since it is smaller than the sum of its proper divisors (170537899732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136782208300 is a wasteful number, since it uses less digits than its factorization.
136782208300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133679 (or 133672 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 40.
The spelling of 136782208300 in words is "one hundred thirty-six billion, seven hundred eighty-two million, two hundred eight thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •