Base | Representation |
---|---|
bin | 111111101000110011… |
… | …0100111110110001000 |
3 | 111001202002221012011211 |
4 | 1333101212213312020 |
5 | 4214340100032000 |
6 | 142440405502504 |
7 | 12605401333363 |
oct | 1772146476610 |
9 | 431662835154 |
10 | 136660549000 |
11 | 52a59354188 |
12 | 2259b411a34 |
13 | cb6ba78ca1 |
14 | 6885d030da |
15 | 384c9797ba |
hex | 1fd19a7d88 |
136660549000 has 64 divisors (see below), whose sum is σ = 333689466240. Its totient is φ = 52287505600.
The previous prime is 136660548989. The next prime is 136660549019. The reversal of 136660549000 is 945066631.
It is a super-2 number, since 2×1366605490002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2947882 + ... + 2993881.
It is an arithmetic number, because the mean of its divisors is an integer number (5213897910).
Almost surely, 2136660549000 is an apocalyptic number.
136660549000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136660549000 is an abundant number, since it is smaller than the sum of its proper divisors (197028917240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136660549000 is a wasteful number, since it uses less digits than its factorization.
136660549000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5941807 (or 5941793 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 40.
The spelling of 136660549000 in words is "one hundred thirty-six billion, six hundred sixty million, five hundred forty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •