Base | Representation |
---|---|
bin | 1100001100101111110001… |
… | …1001000000000110011001 |
3 | 1202111021121120000100021021 |
4 | 3003023330121000012121 |
5 | 3224230033302414203 |
6 | 44305523041242441 |
7 | 2553031450323520 |
oct | 303137431000631 |
9 | 52437546010237 |
10 | 13413122310553 |
11 | 4301522957249 |
12 | 1607677633421 |
13 | 763b0cb20c54 |
14 | 3452accb14b7 |
15 | 183d8d0e25bd |
hex | c32fc640199 |
13413122310553 has 8 divisors (see below), whose sum is σ = 15487316483072. Its totient is φ = 11378436598656.
The previous prime is 13413122310551. The next prime is 13413122310593. The reversal of 13413122310553 is 35501322131431.
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 13413122310553 - 21 = 13413122310551 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13413122310551) 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, 9877114425 + ... + 9877115782.
It is an arithmetic number, because the mean of its divisors is an integer number (1935914560384).
Almost surely, 213413122310553 is an apocalyptic number.
It is an amenable number.
13413122310553 is a deficient number, since it is larger than the sum of its proper divisors (2074194172519).
13413122310553 is an equidigital number, since it uses as much as digits as its factorization.
13413122310553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19754230311.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 13413122310553 its reverse (35501322131431), we get a palindrome (48914444441984).
The spelling of 13413122310553 in words is "thirteen trillion, four hundred thirteen billion, one hundred twenty-two million, three hundred ten thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •