Base | Representation |
---|---|
bin | 11110111100101010111011… |
… | …100100100101111110011100 |
3 | 122211221001101221212211211010 |
4 | 132330222323210211332130 |
5 | 120320014113044323424 |
6 | 1201252212500255220 |
7 | 40445446024255614 |
oct | 3674527344457634 |
9 | 584831357784733 |
10 | 136110660542364 |
11 | 3a407230529a72 |
12 | 133231a89a1510 |
13 | 5ac4245c17541 |
14 | 2587b10b97a44 |
15 | 10b083d605229 |
hex | 7bcabb925f9c |
136110660542364 has 24 divisors (see below), whose sum is σ = 319015718586880. Its totient is φ = 45166766277744.
The previous prime is 136110660542357. The next prime is 136110660542371. The reversal of 136110660542364 is 463245066011631.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (136110660542357) and next prime (136110660542371).
It is a super-2 number, since 2×1361106605423642 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25431735094 + ... + 25431740445.
Almost surely, 2136110660542364 is an apocalyptic number.
It is an amenable number.
136110660542364 is an abundant number, since it is smaller than the sum of its proper divisors (182905058044516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136110660542364 is a wasteful number, since it uses less digits than its factorization.
136110660542364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50863475769 (or 50863475767 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 48.
The spelling of 136110660542364 in words is "one hundred thirty-six trillion, one hundred ten billion, six hundred sixty million, five hundred forty-two thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •