Base | Representation |
---|---|
bin | 111111011101010011… |
… | …1000000111111001101 |
3 | 111000202020000220010102 |
4 | 1332322213000333031 |
5 | 4213042320313023 |
6 | 142334225220445 |
7 | 12563005324655 |
oct | 1767247007715 |
9 | 430666026112 |
10 | 136274776013 |
11 | 52880616232 |
12 | 224b2191725 |
13 | cb09b7924c |
14 | 684a9a3365 |
15 | 3828b76628 |
hex | 1fba9c0fcd |
136274776013 has 4 divisors (see below), whose sum is σ = 136756312608. Its totient is φ = 135793239420.
The previous prime is 136274776007. The next prime is 136274776021. The reversal of 136274776013 is 310677472631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310677472631 = 2377 ⋅130701503.
It is a cyclic number.
It is not a de Polignac number, because 136274776013 - 210 = 136274774989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136274776093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240767873 + ... + 240768438.
It is an arithmetic number, because the mean of its divisors is an integer number (34189078152).
Almost surely, 2136274776013 is an apocalyptic number.
It is an amenable number.
136274776013 is a deficient number, since it is larger than the sum of its proper divisors (481536595).
136274776013 is an equidigital number, since it uses as much as digits as its factorization.
136274776013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481536594.
The product of its (nonzero) digits is 889056, while the sum is 47.
The spelling of 136274776013 in words is "one hundred thirty-six billion, two hundred seventy-four million, seven hundred seventy-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •