Base | Representation |
---|---|
bin | 110001111100101001… |
… | …101010001111000101 |
3 | 12010102122000011111112 |
4 | 301330221222033011 |
5 | 1334314002400422 |
6 | 40345424214405 |
7 | 3606011104322 |
oct | 617451521705 |
9 | 163378004445 |
10 | 53630903237 |
11 | 2082127942a |
12 | a488a6a405 |
13 | 509907cc92 |
14 | 284aa45b49 |
15 | 15dd50cee2 |
hex | c7ca6a3c5 |
53630903237 has 2 divisors, whose sum is σ = 53630903238. Its totient is φ = 53630903236.
The previous prime is 53630903203. The next prime is 53630903341. The reversal of 53630903237 is 73230903635.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51254243236 + 2376660001 = 226394^2 + 48751^2 .
It is a cyclic number.
It is not a de Polignac number, because 53630903237 - 218 = 53630641093 is a prime.
It is a super-3 number, since 3×536309032373 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53630903194 and 53630903203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53630906237) 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, 26815451618 + 26815451619.
It is an arithmetic number, because the mean of its divisors is an integer number (26815451619).
Almost surely, 253630903237 is an apocalyptic number.
It is an amenable number.
53630903237 is a deficient number, since it is larger than the sum of its proper divisors (1).
53630903237 is an equidigital number, since it uses as much as digits as its factorization.
53630903237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 306180, while the sum is 41.
The spelling of 53630903237 in words is "fifty-three billion, six hundred thirty million, nine hundred three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •