Base | Representation |
---|---|
bin | 111111101000100010… |
… | …1110010101001100100 |
3 | 111001201111201221021120 |
4 | 1333101011302221210 |
5 | 4214330344130000 |
6 | 142435501213540 |
7 | 12605235226503 |
oct | 1772105625144 |
9 | 431644657246 |
10 | 136651942500 |
11 | 52a54505a77 |
12 | 225985612b0 |
13 | cb6a054798 |
14 | 6884b0283a |
15 | 384bd296a0 |
hex | 1fd1172a64 |
136651942500 has 240 divisors, whose sum is σ = 422489760000. Its totient is φ = 34269264000.
The previous prime is 136651942457. The next prime is 136651942517. The reversal of 136651942500 is 5249156631.
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 79 ways as a sum of consecutive naturals, for example, 19804051 + ... + 19810949.
It is an arithmetic number, because the mean of its divisors is an integer number (1760374000).
Almost surely, 2136651942500 is an apocalyptic number.
136651942500 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 136651942500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211244880000).
136651942500 is an abundant number, since it is smaller than the sum of its proper divisors (285837817500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136651942500 is a wasteful number, since it uses less digits than its factorization.
136651942500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7084 (or 7067 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 136651942500 in words is "one hundred thirty-six billion, six hundred fifty-one million, nine hundred forty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •