Base | Representation |
---|---|
bin | 110001011000010110… |
… | …111101101010111011 |
3 | 12001212012021210220212 |
4 | 301120112331222323 |
5 | 1332042114203311 |
6 | 40205153541335 |
7 | 3554635516325 |
oct | 613026755273 |
9 | 161765253825 |
10 | 53022022331 |
11 | 20539605173 |
12 | a338b7484b |
13 | 4cccb95015 |
14 | 27cdc2a615 |
15 | 15a4d38c8b |
hex | c585bdabb |
53022022331 has 2 divisors, whose sum is σ = 53022022332. Its totient is φ = 53022022330.
The previous prime is 53022022309. The next prime is 53022022343. The reversal of 53022022331 is 13322022035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53022022331 - 26 = 53022022267 is a prime.
It is a super-2 number, since 2×530220223312 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 53022022297 and 53022022306.
It is not a weakly prime, because it can be changed into another prime (53022024331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26511011165 + 26511011166.
It is an arithmetic number, because the mean of its divisors is an integer number (26511011166).
Almost surely, 253022022331 is an apocalyptic number.
53022022331 is a deficient number, since it is larger than the sum of its proper divisors (1).
53022022331 is an equidigital number, since it uses as much as digits as its factorization.
53022022331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 53022022331 its reverse (13322022035), we get a palindrome (66344044366).
The spelling of 53022022331 in words is "fifty-three billion, twenty-two million, twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •