Base | Representation |
---|---|
bin | 111111100101101000… |
… | …1100100000010111001 |
3 | 111001110201010111021021 |
4 | 1333023101210002321 |
5 | 4214130404140423 |
6 | 142422053542441 |
7 | 12602641644355 |
oct | 1771321440271 |
9 | 431421114237 |
10 | 136554365113 |
11 | 52a04419701 |
12 | 2256b944a21 |
13 | cb52a7b89a |
14 | 6875b82465 |
15 | 38434a295d |
hex | 1fcb4640b9 |
136554365113 has 8 divisors (see below), whose sum is σ = 136705703616. Its totient is φ = 136403110800.
The previous prime is 136554365069. The next prime is 136554365161. The reversal of 136554365113 is 311563455631.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136554365113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136554365113.
It is not an unprimeable number, because it can be changed into a prime (136554365413) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3552708 + ... + 3590938.
It is an arithmetic number, because the mean of its divisors is an integer number (17088212952).
Almost surely, 2136554365113 is an apocalyptic number.
It is an amenable number.
136554365113 is a deficient number, since it is larger than the sum of its proper divisors (151338503).
136554365113 is a wasteful number, since it uses less digits than its factorization.
136554365113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42095.
The product of its digits is 486000, while the sum is 43.
The spelling of 136554365113 in words is "one hundred thirty-six billion, five hundred fifty-four million, three hundred sixty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •