Base | Representation |
---|---|
bin | 111111101001100011… |
… | …1011101100100001100 |
3 | 111001210212200221000212 |
4 | 1333103013131210030 |
5 | 4214413044403420 |
6 | 142443113541552 |
7 | 12606130163546 |
oct | 1772307354414 |
9 | 431725627025 |
10 | 136685934860 |
11 | 52a71712a32 |
12 | 225a7a148b8 |
13 | cb740c69c7 |
14 | 6889430696 |
15 | 384ece13c5 |
hex | 1fd31dd90c |
136685934860 has 48 divisors (see below), whose sum is σ = 297523183104. Its totient is φ = 52712392128.
The previous prime is 136685934841. The next prime is 136685934863. The reversal of 136685934860 is 68439586631.
136685934860 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 136685934860.
It is not an unprimeable number, because it can be changed into a prime (136685934863) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1022174 + ... + 1148133.
It is an arithmetic number, because the mean of its divisors is an integer number (6198399648).
Almost surely, 2136685934860 is an apocalyptic number.
136685934860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136685934860 is an abundant number, since it is smaller than the sum of its proper divisors (160837248244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136685934860 is a wasteful number, since it uses less digits than its factorization.
136685934860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170430 (or 2170428 counting only the distinct ones).
The product of its (nonzero) digits is 22394880, while the sum is 59.
The spelling of 136685934860 in words is "one hundred thirty-six billion, six hundred eighty-five million, nine hundred thirty-four thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •