Base | Representation |
---|---|
bin | 1100000110001110111001… |
… | …1111100101000010100001 |
3 | 1202002120202220002011212222 |
4 | 3001203232133211002201 |
5 | 3220411344310112001 |
6 | 44142255054400425 |
7 | 2541660426366026 |
oct | 301435637450241 |
9 | 52076686064788 |
10 | 13301220004001 |
11 | 4269019a26066 |
12 | 15a9a47800115 |
13 | 7563b8493687 |
14 | 33dad51c354d |
15 | 180edded361b |
hex | c18ee7e50a1 |
13301220004001 has 4 divisors (see below), whose sum is σ = 13302739631172. Its totient is φ = 13299700376832.
The previous prime is 13301220003947. The next prime is 13301220004021. The reversal of 13301220004001 is 10040002210331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8167592410000 + 5133627594001 = 2857900^2 + 2265751^2 .
It is a cyclic number.
It is not a de Polignac number, because 13301220004001 - 26 = 13301220003937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13301220004021) 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, 759800456 + ... + 759817961.
It is an arithmetic number, because the mean of its divisors is an integer number (3325684907793).
Almost surely, 213301220004001 is an apocalyptic number.
It is an amenable number.
13301220004001 is a deficient number, since it is larger than the sum of its proper divisors (1519627171).
13301220004001 is an equidigital number, since it uses as much as digits as its factorization.
13301220004001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519627170.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13301220004001 its reverse (10040002210331), we get a palindrome (23341222214332).
The spelling of 13301220004001 in words is "thirteen trillion, three hundred one billion, two hundred twenty million, four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •