Base | Representation |
---|---|
bin | 1011111010110001110110… |
… | …0000100101101110110001 |
3 | 1201101202211222100121110211 |
4 | 2332230131200211232301 |
5 | 3204200343204140023 |
6 | 43512032522424121 |
7 | 2521523150463310 |
oct | 276543540455661 |
9 | 51352758317424 |
10 | 13104440302513 |
11 | 41a261aa1189a |
12 | 157788a662041 |
13 | 74098839c2a1 |
14 | 334388a92277 |
15 | 17ad2361ba0d |
hex | beb1d825bb1 |
13104440302513 has 8 divisors (see below), whose sum is σ = 14976669055232. Its totient is φ = 11232253012896.
The previous prime is 13104440302409. The next prime is 13104440302523. The reversal of 13104440302513 is 31520304440131.
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 13104440302513 - 221 = 13104438205361 is a prime.
It is a super-3 number, since 3×131044403025133 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13104440302523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9685545 + ... + 10955302.
It is an arithmetic number, because the mean of its divisors is an integer number (1872083631904).
Almost surely, 213104440302513 is an apocalyptic number.
It is an amenable number.
13104440302513 is a deficient number, since it is larger than the sum of its proper divisors (1872228752719).
13104440302513 is an equidigital number, since it uses as much as digits as its factorization.
13104440302513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20731551.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 13104440302513 its reverse (31520304440131), we get a palindrome (44624744742644).
The spelling of 13104440302513 in words is "thirteen trillion, one hundred four billion, four hundred forty million, three hundred two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •