Base | Representation |
---|---|
bin | 111111101001011100… |
… | …1011101100111110000 |
3 | 111001210121210111000210 |
4 | 1333102321131213300 |
5 | 4214411124440242 |
6 | 142442503144120 |
7 | 12606054040503 |
oct | 1772271354760 |
9 | 431717714023 |
10 | 136682265072 |
11 | 52a6a636851 |
12 | 225a6745040 |
13 | cb73410532 |
14 | 6888b5713a |
15 | 384e818d9c |
hex | 1fd2e5d9f0 |
136682265072 has 80 divisors (see below), whose sum is σ = 356661200000. Its totient is φ = 45102604032.
The previous prime is 136682264993. The next prime is 136682265073. The reversal of 136682265072 is 270562286631.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136682265073) 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, 2299179 + ... + 2357877.
It is an arithmetic number, because the mean of its divisors is an integer number (4458265000).
Almost surely, 2136682265072 is an apocalyptic number.
136682265072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136682265072 is an abundant number, since it is smaller than the sum of its proper divisors (219978934928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136682265072 is a wasteful number, since it uses less digits than its factorization.
136682265072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59198 (or 59192 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 48.
The spelling of 136682265072 in words is "one hundred thirty-six billion, six hundred eighty-two million, two hundred sixty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •