Base | Representation |
---|---|
bin | 111111101010110101… |
… | …0011010101011110010 |
3 | 111001220212002012122210 |
4 | 1333111222122223302 |
5 | 4220010013340110 |
6 | 142451241312550 |
7 | 12610156241061 |
oct | 1772552325362 |
9 | 431825065583 |
10 | 136728652530 |
11 | 52a9383a398 |
12 | 225ba195756 |
13 | cb7cc02532 |
14 | 6890d901d8 |
15 | 385392d520 |
hex | 1fd5a9aaf2 |
136728652530 has 48 divisors (see below), whose sum is σ = 346328780544. Its totient is φ = 34541972640.
The previous prime is 136728652513. The next prime is 136728652531. The reversal of 136728652530 is 35256827631.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 136728652530.
It is not an unprimeable number, because it can be changed into a prime (136728652531) 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 23 ways as a sum of consecutive naturals, for example, 6301666 + ... + 6323325.
It is an arithmetic number, because the mean of its divisors is an integer number (7215182928).
Almost surely, 2136728652530 is an apocalyptic number.
136728652530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136728652530 is an abundant number, since it is smaller than the sum of its proper divisors (209600128014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136728652530 is a wasteful number, since it uses less digits than its factorization.
136728652530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12625039 (or 12625020 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 48.
The spelling of 136728652530 in words is "one hundred thirty-six billion, seven hundred twenty-eight million, six hundred fifty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •