Base | Representation |
---|---|
bin | 111111101001011100… |
… | …1011101100101101100 |
3 | 111001210121210110211220 |
4 | 1333102321131211230 |
5 | 4214411124434230 |
6 | 142442503143340 |
7 | 12606054040224 |
oct | 1772271354554 |
9 | 431717713756 |
10 | 136682264940 |
11 | 52a6a636741 |
12 | 225a6744b50 |
13 | cb73410460 |
14 | 6888b57084 |
15 | 384e818d10 |
hex | 1fd2e5d96c |
136682264940 has 48 divisors (see below), whose sum is σ = 412149601248. Its totient is φ = 33644865024.
The previous prime is 136682264909. The next prime is 136682264941. The reversal of 136682264940 is 49462286631.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (136682264941) 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 15 ways as a sum of consecutive naturals, for example, 87616057 + ... + 87617616.
It is an arithmetic number, because the mean of its divisors is an integer number (8586450026).
Almost surely, 2136682264940 is an apocalyptic number.
136682264940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136682264940 is an abundant number, since it is smaller than the sum of its proper divisors (275467336308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136682264940 is a wasteful number, since it uses less digits than its factorization.
136682264940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175233698 (or 175233696 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 51.
The spelling of 136682264940 in words is "one hundred thirty-six billion, six hundred eighty-two million, two hundred sixty-four thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •