Base | Representation |
---|---|
bin | 1011111100101000101100… |
… | …0000111000010001000101 |
3 | 1201111211012021111200201002 |
4 | 2333022023000320101011 |
5 | 3210211212104122121 |
6 | 43534430300143045 |
7 | 2524032543552203 |
oct | 277121300702105 |
9 | 51454167450632 |
10 | 13136342254661 |
11 | 42051008146aa |
12 | 1581ab2537a85 |
13 | 7439a07cc652 |
14 | 335b33952073 |
15 | 17ba8e1dbe0b |
hex | bf28b038445 |
13136342254661 has 8 divisors (see below), whose sum is σ = 13522681050624. Its totient is φ = 12751650959760.
The previous prime is 13136342254589. The next prime is 13136342254681. The reversal of 13136342254661 is 16645224363131.
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 not a de Polignac number, because 13136342254661 - 218 = 13136341992517 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 (13136342254681) 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, 411859085 + ... + 411890978.
It is an arithmetic number, because the mean of its divisors is an integer number (1690335131328).
Almost surely, 213136342254661 is an apocalyptic number.
It is an amenable number.
13136342254661 is a deficient number, since it is larger than the sum of its proper divisors (386338795963).
13136342254661 is an equidigital number, since it uses as much as digits as its factorization.
13136342254661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823750531.
The product of its digits is 1866240, while the sum is 47.
The spelling of 13136342254661 in words is "thirteen trillion, one hundred thirty-six billion, three hundred forty-two million, two hundred fifty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •