Base | Representation |
---|---|
bin | 1011110101101011010111… |
… | …1000110001011010101001 |
3 | 1201002101122100022012201122 |
4 | 2331122311320301122221 |
5 | 3201231402412343244 |
6 | 43403500403425025 |
7 | 2512301333244206 |
oct | 275326570613251 |
9 | 51071570265648 |
10 | 13016802465449 |
11 | 416943870a782 |
12 | 15628b0985175 |
13 | 73562ca78773 |
14 | 3300337a4cad |
15 | 1788e48401ee |
hex | bd6b5e316a9 |
13016802465449 has 2 divisors, whose sum is σ = 13016802465450. Its totient is φ = 13016802465448.
The previous prime is 13016802465421. The next prime is 13016802465451. The reversal of 13016802465449 is 94456420861031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11616679305625 + 1400123159824 = 3408325^2 + 1183268^2 .
It is a cyclic number.
It is not a de Polignac number, because 13016802465449 - 28 = 13016802465193 is a prime.
Together with 13016802465451, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13016802465449.
It is not a weakly prime, because it can be changed into another prime (13016802465349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6508401232724 + 6508401232725.
It is an arithmetic number, because the mean of its divisors is an integer number (6508401232725).
Almost surely, 213016802465449 is an apocalyptic number.
It is an amenable number.
13016802465449 is a deficient number, since it is larger than the sum of its proper divisors (1).
13016802465449 is an equidigital number, since it uses as much as digits as its factorization.
13016802465449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 53.
The spelling of 13016802465449 in words is "thirteen trillion, sixteen billion, eight hundred two million, four hundred sixty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •