Base | Representation |
---|---|
bin | 1011111110001010101011… |
… | …0000100000001110001001 |
3 | 1201121100002100002010121101 |
4 | 2333202222300200032021 |
5 | 3211124044011332203 |
6 | 43554500243341401 |
7 | 2525653414244266 |
oct | 277425260401611 |
9 | 51540070063541 |
10 | 13162644636553 |
11 | 42152788254a5 |
12 | 1587013081861 |
13 | 746302ac6029 |
14 | 33710ac7a26d |
15 | 17c5cd3c041d |
hex | bf8aac20389 |
13162644636553 has 4 divisors (see below), whose sum is σ = 13165387430400. Its totient is φ = 13159901842708.
The previous prime is 13162644636527. The next prime is 13162644636569. The reversal of 13162644636553 is 35563644626131.
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.
It is a cyclic number.
It is not a de Polignac number, because 13162644636553 - 217 = 13162644505481 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13162644636494 and 13162644636503.
It is not an unprimeable number, because it can be changed into a prime (13162644636353) 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, 1371389725 + ... + 1371399322.
It is an arithmetic number, because the mean of its divisors is an integer number (3291346857600).
Almost surely, 213162644636553 is an apocalyptic number.
It is an amenable number.
13162644636553 is a deficient number, since it is larger than the sum of its proper divisors (2742793847).
13162644636553 is an equidigital number, since it uses as much as digits as its factorization.
13162644636553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2742793846.
The product of its digits is 27993600, while the sum is 55.
The spelling of 13162644636553 in words is "thirteen trillion, one hundred sixty-two billion, six hundred forty-four million, six hundred thirty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •