Base | Representation |
---|---|
bin | 1100110000010… |
… | …1100011011011 |
3 | 10201200002101001 |
4 | 3030011203123 |
5 | 102144000443 |
6 | 5150405431 |
7 | 1216513015 |
oct | 314054333 |
9 | 121602331 |
10 | 53500123 |
11 | 28221486 |
12 | 15b00877 |
13 | b1125a1 |
14 | 71691b5 |
15 | 4a6bd4d |
hex | 33058db |
53500123 has 2 divisors, whose sum is σ = 53500124. Its totient is φ = 53500122.
The previous prime is 53500091. The next prime is 53500129. The reversal of 53500123 is 32100535.
53500123 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 53500123 - 25 = 53500091 is a prime.
It is a super-2 number, since 2×535001232 = 5724526322030258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53500123.
It is not a weakly prime, because it can be changed into another prime (53500129) 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, 26750061 + 26750062.
It is an arithmetic number, because the mean of its divisors is an integer number (26750062).
Almost surely, 253500123 is an apocalyptic number.
53500123 is a deficient number, since it is larger than the sum of its proper divisors (1).
53500123 is an equidigital number, since it uses as much as digits as its factorization.
53500123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 19.
The square root of 53500123 is about 7314.3778272660. The cubic root of 53500123 is about 376.8063909367.
Adding to 53500123 its reverse (32100535), we get a palindrome (85600658).
The spelling of 53500123 in words is "fifty-three million, five hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •