Base | Representation |
---|---|
bin | 11000101010110000… |
… | …11011000000000101 |
3 | 1021011222012212210022 |
4 | 30111120123000011 |
5 | 204110332003402 |
6 | 10030052504525 |
7 | 646121646665 |
oct | 142530330005 |
9 | 37158185708 |
10 | 13243625477 |
11 | 5686754925 |
12 | 269731b145 |
13 | 13309c1aa4 |
14 | 8d8c661a5 |
15 | 527a272a2 |
hex | 31561b005 |
13243625477 has 2 divisors, whose sum is σ = 13243625478. Its totient is φ = 13243625476.
The previous prime is 13243625449. The next prime is 13243625497. The reversal of 13243625477 is 77452634231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8414209441 + 4829416036 = 91729^2 + 69494^2 .
It is a cyclic number.
It is not a de Polignac number, because 13243625477 - 28 = 13243625221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13243625497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6621812738 + 6621812739.
It is an arithmetic number, because the mean of its divisors is an integer number (6621812739).
Almost surely, 213243625477 is an apocalyptic number.
It is an amenable number.
13243625477 is a deficient number, since it is larger than the sum of its proper divisors (1).
13243625477 is an equidigital number, since it uses as much as digits as its factorization.
13243625477 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 846720, while the sum is 44.
The spelling of 13243625477 in words is "thirteen billion, two hundred forty-three million, six hundred twenty-five thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •