Base | Representation |
---|---|
bin | 1100001100000111011101… |
… | …1101010101111000010001 |
3 | 1202110020200110221221011112 |
4 | 3003001313131111320101 |
5 | 3224040403322102032 |
6 | 44300533235423105 |
7 | 2552166353403503 |
oct | 303016735257021 |
9 | 52406613857145 |
10 | 13402302144017 |
11 | 42a7980187a56 |
12 | 1605557a54a95 |
13 | 762aa723c747 |
14 | 344963c53d73 |
15 | 1839582271b2 |
hex | c3077755e11 |
13402302144017 has 2 divisors, whose sum is σ = 13402302144018. Its totient is φ = 13402302144016.
The previous prime is 13402302143977. The next prime is 13402302144031. The reversal of 13402302144017 is 71044120320431.
13402302144017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10422314746321 + 2979987397696 = 3228361^2 + 1726264^2 .
It is a cyclic number.
It is not a de Polignac number, because 13402302144017 - 230 = 13401228402193 is a prime.
It is not a weakly prime, because it can be changed into another prime (13402302144097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6701151072008 + 6701151072009.
It is an arithmetic number, because the mean of its divisors is an integer number (6701151072009).
Almost surely, 213402302144017 is an apocalyptic number.
It is an amenable number.
13402302144017 is a deficient number, since it is larger than the sum of its proper divisors (1).
13402302144017 is an equidigital number, since it uses as much as digits as its factorization.
13402302144017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16128, while the sum is 32.
Adding to 13402302144017 its reverse (71044120320431), we get a palindrome (84446422464448).
The spelling of 13402302144017 in words is "thirteen trillion, four hundred two billion, three hundred two million, one hundred forty-four thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •