Base | Representation |
---|---|
bin | 111111011001110001… |
… | …0000001001011001110 |
3 | 111000102221120202010010 |
4 | 1332303202001023032 |
5 | 4212321420304200 |
6 | 142314344054050 |
7 | 12560034056466 |
oct | 1766342011316 |
9 | 430387522103 |
10 | 136156025550 |
11 | 5281a588256 |
12 | 2247a464326 |
13 | cabb39bcbc |
14 | 6838cd0ba6 |
15 | 381d51b150 |
hex | 1fb38812ce |
136156025550 has 48 divisors (see below), whose sum is σ = 338106328560. Its totient is φ = 36261027840.
The previous prime is 136156025549. The next prime is 136156025563. The reversal of 136156025550 is 55520651631.
It is a junction number, because it is equal to n+sod(n) for n = 136156025499 and 136156025508.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 474837 + ... + 705536.
It is an arithmetic number, because the mean of its divisors is an integer number (7043881845).
Almost surely, 2136156025550 is an apocalyptic number.
136156025550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136156025550 is an abundant number, since it is smaller than the sum of its proper divisors (201950303010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136156025550 is a wasteful number, since it uses less digits than its factorization.
136156025550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181157 (or 1181152 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 136156025550 in words is "one hundred thirty-six billion, one hundred fifty-six million, twenty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •