Base | Representation |
---|---|
bin | 1100001000100000100100… |
… | …0010010001111111011101 |
3 | 1202020022200211122111121121 |
4 | 3002020021002101333131 |
5 | 3222031433410424201 |
6 | 44212243003330541 |
7 | 2544543365113120 |
oct | 302101102217735 |
9 | 52208624574547 |
10 | 13340320014301 |
11 | 4283663959565 |
12 | 15b553a220a51 |
13 | 759ca9c54147 |
14 | 3419640383b7 |
15 | 18202b9919a1 |
hex | c2209091fdd |
13340320014301 has 8 divisors (see below), whose sum is σ = 15263953505024. Its totient is φ = 11421154895760.
The previous prime is 13340320014299. The next prime is 13340320014353. The reversal of 13340320014301 is 10341002304331.
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 13340320014301 - 21 = 13340320014299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13340320014001) 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, 1117086645 + ... + 1117098586.
It is an arithmetic number, because the mean of its divisors is an integer number (1907994188128).
Almost surely, 213340320014301 is an apocalyptic number.
It is an amenable number.
13340320014301 is a deficient number, since it is larger than the sum of its proper divisors (1923633490723).
13340320014301 is an equidigital number, since it uses as much as digits as its factorization.
13340320014301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2234186091.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13340320014301 its reverse (10341002304331), we get a palindrome (23681322318632).
The spelling of 13340320014301 in words is "thirteen trillion, three hundred forty billion, three hundred twenty million, fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •