Base | Representation |
---|---|
bin | 100111101101101101011… |
… | …1001110101001110111101 |
3 | 201022210202222210001202102 |
4 | 1033123122321311032331 |
5 | 1203412024422344021 |
6 | 15335255534034445 |
7 | 1102230202330622 |
oct | 117333271651675 |
9 | 21283688701672 |
10 | 5458281059261 |
11 | 18149313a7338 |
12 | 741a27348a25 |
13 | 307937cb0c94 |
14 | 14c279dc6349 |
15 | 96eb09c700b |
hex | 4f6dae753bd |
5458281059261 has 2 divisors, whose sum is σ = 5458281059262. Its totient is φ = 5458281059260.
The previous prime is 5458281059183. The next prime is 5458281059281. The reversal of 5458281059261 is 1629501828545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5455055387236 + 3225672025 = 2335606^2 + 56795^2 .
It is a cyclic number.
It is not a de Polignac number, because 5458281059261 - 230 = 5457207317437 is a prime.
It is a super-2 number, since 2×54582810592612 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5458281059197 and 5458281059206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5458281059281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2729140529630 + 2729140529631.
It is an arithmetic number, because the mean of its divisors is an integer number (2729140529631).
Almost surely, 25458281059261 is an apocalyptic number.
It is an amenable number.
5458281059261 is a deficient number, since it is larger than the sum of its proper divisors (1).
5458281059261 is an equidigital number, since it uses as much as digits as its factorization.
5458281059261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912000, while the sum is 56.
The spelling of 5458281059261 in words is "five trillion, four hundred fifty-eight billion, two hundred eighty-one million, fifty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •