Base | Representation |
---|---|
bin | 100110110111110000001… |
… | …1101010100101100011101 |
3 | 200220201200202012002120022 |
4 | 1031233200131110230131 |
5 | 1200012223443213003 |
6 | 15210134102001525 |
7 | 1060655621602115 |
oct | 115574035245435 |
9 | 20821622162508 |
10 | 5342410132253 |
11 | 177a781274937 |
12 | 72348a4162a5 |
13 | 2c9a3039ab8c |
14 | 1468071d2045 |
15 | 93e7d290738 |
hex | 4dbe0754b1d |
5342410132253 has 2 divisors, whose sum is σ = 5342410132254. Its totient is φ = 5342410132252.
The previous prime is 5342410132183. The next prime is 5342410132259. The reversal of 5342410132253 is 3522310142435.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3142685108644 + 2199725023609 = 1772762^2 + 1483147^2 .
It is a cyclic number.
It is not a de Polignac number, because 5342410132253 - 212 = 5342410128157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5342410132259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2671205066126 + 2671205066127.
It is an arithmetic number, because the mean of its divisors is an integer number (2671205066127).
Almost surely, 25342410132253 is an apocalyptic number.
It is an amenable number.
5342410132253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5342410132253 is an equidigital number, since it uses as much as digits as its factorization.
5342410132253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 5342410132253 its reverse (3522310142435), we get a palindrome (8864720274688).
The spelling of 5342410132253 in words is "five trillion, three hundred forty-two billion, four hundred ten million, one hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •