Base | Representation |
---|---|
bin | 1100010100111010011100… |
… | …0011010010010101000001 |
3 | 1202222200202110021210100012 |
4 | 3011032213003102111001 |
5 | 3234024403131203312 |
6 | 44454205055434305 |
7 | 2566126331130206 |
oct | 305164703222501 |
9 | 52880673253305 |
10 | 13553424475457 |
11 | 4355a7a863349 |
12 | 162a8b2525995 |
13 | 77410c18b239 |
14 | 34bdbc6b7cad |
15 | 1878505ee322 |
hex | c53a70d2541 |
13553424475457 has 2 divisors, whose sum is σ = 13553424475458. Its totient is φ = 13553424475456.
The previous prime is 13553424475427. The next prime is 13553424475499. The reversal of 13553424475457 is 75457442435531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8689000139521 + 4864424335936 = 2947711^2 + 2205544^2 .
It is a cyclic number.
It is not a de Polignac number, because 13553424475457 - 230 = 13552350733633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13553424475396 and 13553424475405.
It is not a weakly prime, because it can be changed into another prime (13553424475427) 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 as a sum of consecutive naturals, namely, 6776712237728 + 6776712237729.
It is an arithmetic number, because the mean of its divisors is an integer number (6776712237729).
Almost surely, 213553424475457 is an apocalyptic number.
It is an amenable number.
13553424475457 is a deficient number, since it is larger than the sum of its proper divisors (1).
13553424475457 is an equidigital number, since it uses as much as digits as its factorization.
13553424475457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 141120000, while the sum is 59.
The spelling of 13553424475457 in words is "thirteen trillion, five hundred fifty-three billion, four hundred twenty-four million, four hundred seventy-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •