Base | Representation |
---|---|
bin | 1100110000100… |
… | …1000111101011 |
3 | 10201200211102002 |
4 | 3030021013223 |
5 | 102144432411 |
6 | 5151001215 |
7 | 1216603424 |
oct | 314110753 |
9 | 121624362 |
10 | 53514731 |
11 | 28231456 |
12 | 15b0920b |
13 | b11912a |
14 | 717064b |
15 | 4a7133b |
hex | 33091eb |
53514731 has 2 divisors, whose sum is σ = 53514732. Its totient is φ = 53514730.
The previous prime is 53514719. The next prime is 53514737. The reversal of 53514731 is 13741535.
53514731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53514731 - 26 = 53514667 is a prime.
It is a super-2 number, since 2×535147312 = 5727652868004722, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 53514694 and 53514703.
It is not a weakly prime, because it can be changed into another prime (53514737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26757365 + 26757366.
It is an arithmetic number, because the mean of its divisors is an integer number (26757366).
Almost surely, 253514731 is an apocalyptic number.
53514731 is a deficient number, since it is larger than the sum of its proper divisors (1).
53514731 is an equidigital number, since it uses as much as digits as its factorization.
53514731 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6300, while the sum is 29.
The square root of 53514731 is about 7315.3763402849. The cubic root of 53514731 is about 376.8406829878.
It can be divided in two parts, 53514 and 731, that added together give a palindrome (54245).
The spelling of 53514731 in words is "fifty-three million, five hundred fourteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •