Base | Representation |
---|---|
bin | 11010010100011110111010… |
… | …00010000000111000101101 |
3 | 21120221010020200202222210222 |
4 | 31022033131002000320231 |
5 | 30041234422001400003 |
6 | 323032544432541125 |
7 | 15122401344561662 |
oct | 1512173502007055 |
9 | 246833220688728 |
10 | 57878392606253 |
11 | 174950a781551a |
12 | 65a92786b17a5 |
13 | 263aba81087cb |
14 | 1041487283a69 |
15 | 6a583a95ec38 |
hex | 34a3dd080e2d |
57878392606253 has 2 divisors, whose sum is σ = 57878392606254. Its totient is φ = 57878392606252.
The previous prime is 57878392606207. The next prime is 57878392606267. The reversal of 57878392606253 is 35260629387875.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49963381236484 + 7915011369769 = 7068478^2 + 2813363^2 .
It is a cyclic number.
It is not a de Polignac number, because 57878392606253 - 218 = 57878392344109 is a prime.
It is a super-3 number, since 3×578783926062533 (a number of 42 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57878392606453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28939196303126 + 28939196303127.
It is an arithmetic number, because the mean of its divisors is an integer number (28939196303127).
Almost surely, 257878392606253 is an apocalyptic number.
It is an amenable number.
57878392606253 is a deficient number, since it is larger than the sum of its proper divisors (1).
57878392606253 is an equidigital number, since it uses as much as digits as its factorization.
57878392606253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 914457600, while the sum is 71.
The spelling of 57878392606253 in words is "fifty-seven trillion, eight hundred seventy-eight billion, three hundred ninety-two million, six hundred six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •