Base | Representation |
---|---|
bin | 1100101101001… |
… | …1111110011011 |
3 | 10201021202210212 |
4 | 3023103332123 |
5 | 102121001201 |
6 | 5142201335 |
7 | 1215005663 |
oct | 313237633 |
9 | 121252725 |
10 | 53297051 |
11 | 280a2955 |
12 | 15a2324b |
13 | b071022 |
14 | 71151a3 |
15 | 4a2babb |
hex | 32d3f9b |
53297051 has 4 divisors (see below), whose sum is σ = 53312400. Its totient is φ = 53281704.
The previous prime is 53297047. The next prime is 53297053. The reversal of 53297051 is 15079235.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15079235 = 5 ⋅3015847.
It is a cyclic number.
It is not a de Polignac number, because 53297051 - 22 = 53297047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53296999 and 53297017.
It is not an unprimeable number, because it can be changed into a prime (53297053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290 + ... + 10328.
It is an arithmetic number, because the mean of its divisors is an integer number (13328100).
Almost surely, 253297051 is an apocalyptic number.
53297051 is a deficient number, since it is larger than the sum of its proper divisors (15349).
53297051 is a wasteful number, since it uses less digits than its factorization.
53297051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15348.
The product of its (nonzero) digits is 9450, while the sum is 32.
The square root of 53297051 is about 7300.4829292315. The cubic root of 53297051 is about 376.3290347318.
The spelling of 53297051 in words is "fifty-three million, two hundred ninety-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •