Base | Representation |
---|---|
bin | 110001011011000100… |
… | …011101111001010101 |
3 | 12001222100212120201221 |
4 | 301123010131321111 |
5 | 1332140240131422 |
6 | 40213500450341 |
7 | 3556030231465 |
oct | 613304357125 |
9 | 161870776657 |
10 | 53067505237 |
11 | 2056225014a |
12 | a3502499b1 |
13 | 500942b396 |
14 | 27d5ca9ba5 |
15 | 15a8d203c7 |
hex | c5b11de55 |
53067505237 has 2 divisors, whose sum is σ = 53067505238. Its totient is φ = 53067505236.
The previous prime is 53067505193. The next prime is 53067505241. The reversal of 53067505237 is 73250576035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40543433316 + 12524071921 = 201354^2 + 111911^2 .
It is a cyclic number.
It is not a de Polignac number, because 53067505237 - 231 = 50920021589 is a prime.
It is a super-2 number, since 2×530675052372 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53067505193 and 53067505202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53067505537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26533752618 + 26533752619.
It is an arithmetic number, because the mean of its divisors is an integer number (26533752619).
Almost surely, 253067505237 is an apocalyptic number.
It is an amenable number.
53067505237 is a deficient number, since it is larger than the sum of its proper divisors (1).
53067505237 is an equidigital number, since it uses as much as digits as its factorization.
53067505237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 661500, while the sum is 43.
The spelling of 53067505237 in words is "fifty-three billion, sixty-seven million, five hundred five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •