Base | Representation |
---|---|
bin | 111111100110000000… |
… | …0000010000011010000 |
3 | 111001111120001101011221 |
4 | 1333030000002003100 |
5 | 4214142013443030 |
6 | 142423211014424 |
7 | 12603150331126 |
oct | 1771400020320 |
9 | 431446041157 |
10 | 136566546640 |
11 | 52a10289887 |
12 | 22573a3a414 |
13 | cb554553a4 |
14 | 6877633916 |
15 | 38445abe7a |
hex | 1fcc0020d0 |
136566546640 has 40 divisors (see below), whose sum is σ = 321342745248. Its totient is φ = 53968464000.
The previous prime is 136566546619. The next prime is 136566546799. The reversal of 136566546640 is 46645665631.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1365665466402 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10276986 + ... + 10290265.
Almost surely, 2136566546640 is an apocalyptic number.
136566546640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136566546640 is an abundant number, since it is smaller than the sum of its proper divisors (184776198608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136566546640 is a wasteful number, since it uses less digits than its factorization.
136566546640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20567347 (or 20567341 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 136566546640 in words is "one hundred thirty-six billion, five hundred sixty-six million, five hundred forty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •