Base | Representation |
---|---|
bin | 1100000011110111101111… |
… | …1000010100100000000001 |
3 | 1201221201000222011112121221 |
4 | 3000331323320110200001 |
5 | 3214230243423414403 |
6 | 44111504403515041 |
7 | 2536023036443161 |
oct | 300757370244001 |
9 | 51851028145557 |
10 | 13260642404353 |
11 | 4252896a29943 |
12 | 15a2002388a81 |
13 | 75261c859396 |
14 | 33bb660205a1 |
15 | 17ee16955dbd |
hex | c0f7be14801 |
13260642404353 has 8 divisors (see below), whose sum is σ = 13306421306880. Its totient is φ = 13214888327760.
The previous prime is 13260642404333. The next prime is 13260642404413. The reversal of 13260642404353 is 35340424606231.
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 13260642404353 - 213 = 13260642396161 is a prime.
It is a super-2 number, since 2×132606424043532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13260642404323) 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, 5136033 + ... + 7273246.
It is an arithmetic number, because the mean of its divisors is an integer number (1663302663360).
Almost surely, 213260642404353 is an apocalyptic number.
It is an amenable number.
13260642404353 is a deficient number, since it is larger than the sum of its proper divisors (45778902527).
13260642404353 is a wasteful number, since it uses less digits than its factorization.
13260642404353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12412967.
The product of its (nonzero) digits is 1244160, while the sum is 43.
The spelling of 13260642404353 in words is "thirteen trillion, two hundred sixty billion, six hundred forty-two million, four hundred four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •