Base | Representation |
---|---|
bin | 111111101110111101… |
… | …1010111101100010111 |
3 | 111002021111222222001122 |
4 | 1333131323113230113 |
5 | 4220301013030310 |
6 | 142513113314155 |
7 | 12613461656204 |
oct | 1773573275427 |
9 | 432244888048 |
10 | 136867314455 |
11 | 53055038123 |
12 | 2263870595b |
13 | cba2861801 |
14 | 68a5566cab |
15 | 3860bbd555 |
hex | 1fdded7b17 |
136867314455 has 4 divisors (see below), whose sum is σ = 164240777352. Its totient is φ = 109493851560.
The previous prime is 136867314433. The next prime is 136867314457. The reversal of 136867314455 is 554413768631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 554413768631 = 1171 ⋅473453261.
It is not a de Polignac number, because 136867314455 - 26 = 136867314391 is a prime.
It is a super-2 number, since 2×1368673144552 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136867314397 and 136867314406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136867314457) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13686731441 + ... + 13686731450.
It is an arithmetic number, because the mean of its divisors is an integer number (41060194338).
Almost surely, 2136867314455 is an apocalyptic number.
136867314455 is a deficient number, since it is larger than the sum of its proper divisors (27373462897).
136867314455 is an equidigital number, since it uses as much as digits as its factorization.
136867314455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27373462896.
The product of its digits is 7257600, while the sum is 53.
The spelling of 136867314455 in words is "one hundred thirty-six billion, eight hundred sixty-seven million, three hundred fourteen thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •