Base | Representation |
---|---|
bin | 1100101110110… |
… | …0000011010101 |
3 | 10201110210002101 |
4 | 3023230003111 |
5 | 102132130134 |
6 | 5144242101 |
7 | 1215566335 |
oct | 313540325 |
9 | 121423071 |
10 | 53395669 |
11 | 2815aa58 |
12 | 15a70331 |
13 | b0a6b92 |
14 | 713d0c5 |
15 | 4a4ae14 |
hex | 32ec0d5 |
53395669 has 2 divisors, whose sum is σ = 53395670. Its totient is φ = 53395668.
The previous prime is 53395607. The next prime is 53395697. The reversal of 53395669 is 96659335.
It is a happy number.
53395669 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., 27436644 + 25959025 = 5238^2 + 5095^2 .
It is a cyclic number.
It is not a de Polignac number, because 53395669 - 27 = 53395541 is a prime.
It is a super-2 number, since 2×533956692 = 5702194935915122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53395169) 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, 26697834 + 26697835.
It is an arithmetic number, because the mean of its divisors is an integer number (26697835).
Almost surely, 253395669 is an apocalyptic number.
It is an amenable number.
53395669 is a deficient number, since it is larger than the sum of its proper divisors (1).
53395669 is an equidigital number, since it uses as much as digits as its factorization.
53395669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 656100, while the sum is 46.
The square root of 53395669 is about 7307.2340184231. The cubic root of 53395669 is about 376.5610047254.
The spelling of 53395669 in words is "fifty-three million, three hundred ninety-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •