Base | Representation |
---|---|
bin | 111110111000100110001101… |
… | …1010000000011001101101101 |
3 | 2200112111022202111010120001202 |
4 | 1331301030123100003031231 |
5 | 1040000041332021423003 |
6 | 5240231205305415245 |
7 | 224336533615544003 |
oct | 17561143320031555 |
9 | 2615438674116052 |
10 | 553136410342253 |
11 | 15027891a446781 |
12 | 5205566079a525 |
13 | 1a9847028a9cba |
14 | 9a83d3352ca73 |
15 | 43e35327a6088 |
hex | 1f7131b40336d |
553136410342253 has 2 divisors, whose sum is σ = 553136410342254. Its totient is φ = 553136410342252.
The previous prime is 553136410342213. The next prime is 553136410342283. The reversal of 553136410342253 is 352243014631355.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 353507006375524 + 199629403966729 = 18801782^2 + 14129027^2 .
It is a cyclic number.
It is not a de Polignac number, because 553136410342253 - 224 = 553136393565037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 553136410342198 and 553136410342207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (553136410342213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276568205171126 + 276568205171127.
It is an arithmetic number, because the mean of its divisors is an integer number (276568205171127).
Almost surely, 2553136410342253 is an apocalyptic number.
It is an amenable number.
553136410342253 is a deficient number, since it is larger than the sum of its proper divisors (1).
553136410342253 is an equidigital number, since it uses as much as digits as its factorization.
553136410342253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888000, while the sum is 47.
The spelling of 553136410342253 in words is "five hundred fifty-three trillion, one hundred thirty-six billion, four hundred ten million, three hundred forty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •