Base | Representation |
---|---|
bin | 100111100001010101100… |
… | …0011101111010011010101 |
3 | 201020021012002220112122021 |
4 | 1033002223003233103111 |
5 | 1202443114341440021 |
6 | 15315143100533141 |
7 | 1100266541600344 |
oct | 117025303572325 |
9 | 21207162815567 |
10 | 5431708546261 |
11 | 1804635962a98 |
12 | 7388502511b1 |
13 | 305291a46bca |
14 | 14ac78c61b5b |
15 | 96457c34c41 |
hex | 4f0ab0ef4d5 |
5431708546261 has 2 divisors, whose sum is σ = 5431708546262. Its totient is φ = 5431708546260.
The previous prime is 5431708546183. The next prime is 5431708546367. The reversal of 5431708546261 is 1626458071345.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3128674665636 + 2303033880625 = 1768806^2 + 1517575^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5431708546261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5431708546199 and 5431708546208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5431708544261) 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, 2715854273130 + 2715854273131.
It is an arithmetic number, because the mean of its divisors is an integer number (2715854273131).
Almost surely, 25431708546261 is an apocalyptic number.
It is an amenable number.
5431708546261 is a deficient number, since it is larger than the sum of its proper divisors (1).
5431708546261 is an equidigital number, since it uses as much as digits as its factorization.
5431708546261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4838400, while the sum is 52.
The spelling of 5431708546261 in words is "five trillion, four hundred thirty-one billion, seven hundred eight million, five hundred forty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •