Base | Representation |
---|---|
bin | 10111110001010011011010… |
… | …01001001011000111110111 |
3 | 20212002010002111112202020101 |
4 | 23320221231021023013313 |
5 | 23322404200234114334 |
6 | 303101122255014531 |
7 | 14003332362332554 |
oct | 1370515511130767 |
9 | 225063074482211 |
10 | 52271583113719 |
11 | 15723287a4a992 |
12 | 5a426bb50a447 |
13 | 232225c6c3828 |
14 | cc9d5b12ba2b |
15 | 609a85688214 |
hex | 2f8a6d24b1f7 |
52271583113719 has 2 divisors, whose sum is σ = 52271583113720. Its totient is φ = 52271583113718.
The previous prime is 52271583113573. The next prime is 52271583113791. The reversal of 52271583113719 is 91731138517225.
Together with next prime (52271583113791) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52271583113719 - 213 = 52271583105527 is a prime.
It is a super-2 number, since 2×522715831137192 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52271583113719.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52271583113219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26135791556859 + 26135791556860.
It is an arithmetic number, because the mean of its divisors is an integer number (26135791556860).
Almost surely, 252271583113719 is an apocalyptic number.
52271583113719 is a deficient number, since it is larger than the sum of its proper divisors (1).
52271583113719 is an equidigital number, since it uses as much as digits as its factorization.
52271583113719 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3175200, while the sum is 55.
The spelling of 52271583113719 in words is "fifty-two trillion, two hundred seventy-one billion, five hundred eighty-three million, one hundred thirteen thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •