Base | Representation |
---|---|
bin | 111111100110000000… |
… | …0000001111101000000 |
3 | 111001111120001100122010 |
4 | 1333030000001331000 |
5 | 4214142013434430 |
6 | 142423211012520 |
7 | 12603150330015 |
oct | 1771400017500 |
9 | 431446040563 |
10 | 136566546240 |
11 | 52a10289553 |
12 | 22573a3a140 |
13 | cb55455157 |
14 | 687763370c |
15 | 38445abcb0 |
hex | 1fcc001f40 |
136566546240 has 224 divisors, whose sum is σ = 463905843840. Its totient is φ = 33935155200.
The previous prime is 136566546197. The next prime is 136566546271. The reversal of 136566546240 is 42645665631.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 136566546240.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1051270 + ... + 1174010.
Almost surely, 2136566546240 is an apocalyptic number.
136566546240 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 136566546240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231952921920).
136566546240 is an abundant number, since it is smaller than the sum of its proper divisors (327339297600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136566546240 is a wasteful number, since it uses less digits than its factorization.
136566546240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122841 (or 122831 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 48.
The spelling of 136566546240 in words is "one hundred thirty-six billion, five hundred sixty-six million, five hundred forty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •