Base | Representation |
---|---|
bin | 1100101000101… |
… | …1011110000101 |
3 | 10200201200102112 |
4 | 3022023132011 |
5 | 102032000234 |
6 | 5131550405 |
7 | 1212331103 |
oct | 312133605 |
9 | 120650375 |
10 | 53000069 |
11 | 27a0a811 |
12 | 158bb405 |
13 | ac98ab5 |
14 | 7078c73 |
15 | 49bdace |
hex | 328b785 |
53000069 has 2 divisors, whose sum is σ = 53000070. Its totient is φ = 53000068.
The previous prime is 53000047. The next prime is 53000089. The reversal of 53000069 is 96000035.
53000069 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 can be written as a sum of positive squares in only one way, i.e., 27699169 + 25300900 = 5263^2 + 5030^2 .
It is a cyclic number.
It is not a de Polignac number, because 53000069 - 216 = 52934533 is a prime.
It is a super-2 number, since 2×530000692 = 5618014628009522, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53000039) 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, 26500034 + 26500035.
It is an arithmetic number, because the mean of its divisors is an integer number (26500035).
Almost surely, 253000069 is an apocalyptic number.
It is an amenable number.
53000069 is a deficient number, since it is larger than the sum of its proper divisors (1).
53000069 is an equidigital number, since it uses as much as digits as its factorization.
53000069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 53000069 is about 7280.1146282184. The cubic root of 53000069 is about 375.6287384307.
The spelling of 53000069 in words is "fifty-three million, sixty-nine", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •