Base | Representation |
---|---|
bin | 11110111100101010101111… |
… | …000010010111110011110001 |
3 | 122211221000212022011121212021 |
4 | 132330222233002113303301 |
5 | 120320013200230313344 |
6 | 1201252135545031441 |
7 | 40445440561622413 |
oct | 3674525702276361 |
9 | 584830768147767 |
10 | 136110450244849 |
11 | 3a407132853373 |
12 | 1332314a485581 |
13 | 5ac4211496142 |
14 | 2587ad0c949b3 |
15 | 10b0829e14b84 |
hex | 7bcaaf097cf1 |
136110450244849 has 8 divisors (see below), whose sum is σ = 141029056221120. Its totient is φ = 131278899241776.
The previous prime is 136110450244843. The next prime is 136110450244907. The reversal of 136110450244849 is 948442054011631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136110450244849 - 23 = 136110450244841 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136110450244796 and 136110450244805.
It is not an unprimeable number, because it can be changed into a prime (136110450244841) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21763740117 + ... + 21763746370.
It is an arithmetic number, because the mean of its divisors is an integer number (17628632027640).
Almost surely, 2136110450244849 is an apocalyptic number.
It is an amenable number.
136110450244849 is a deficient number, since it is larger than the sum of its proper divisors (4918605976271).
136110450244849 is an equidigital number, since it uses as much as digits as its factorization.
136110450244849 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43527486599.
The product of its (nonzero) digits is 3317760, while the sum is 52.
The spelling of 136110450244849 in words is "one hundred thirty-six trillion, one hundred ten billion, four hundred fifty million, two hundred forty-four thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •