Base | Representation |
---|---|
bin | 11000001000110010101101… |
… | …11101111101110000001111 |
3 | 20221221021022102100221110212 |
4 | 30010121112331331300033 |
5 | 23424120101210201041 |
6 | 304520000235153035 |
7 | 14115543540505343 |
oct | 1404312675756017 |
9 | 227837272327425 |
10 | 53078664928271 |
11 | 15a04598659784 |
12 | 5b530015a577b |
13 | 23803b18c03c8 |
14 | d17041c29623 |
15 | 620a705558eb |
hex | 304656f7dc0f |
53078664928271 has 2 divisors, whose sum is σ = 53078664928272. Its totient is φ = 53078664928270.
The previous prime is 53078664928249. The next prime is 53078664928273. The reversal of 53078664928271 is 17282946687035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53078664928271 - 26 = 53078664928207 is a prime.
It is a super-3 number, since 3×530786649282713 (a number of 42 digits) contains 333 as substring.
Together with 53078664928273, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53078664928273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26539332464135 + 26539332464136.
It is an arithmetic number, because the mean of its divisors is an integer number (26539332464136).
It is a 2-persistent number, because it is pandigital, and so is 2⋅53078664928271 = 106157329856542, but 3⋅53078664928271 = 159235994784813 is not.
Almost surely, 253078664928271 is an apocalyptic number.
53078664928271 is a deficient number, since it is larger than the sum of its proper divisors (1).
53078664928271 is an equidigital number, since it uses as much as digits as its factorization.
53078664928271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243855360, while the sum is 68.
The spelling of 53078664928271 in words is "fifty-three trillion, seventy-eight billion, six hundred sixty-four million, nine hundred twenty-eight thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •