Base | Representation |
---|---|
bin | 1100010010001… |
… | …1011010000101 |
3 | 10120221202100201 |
4 | 3010203122011 |
5 | 101142302003 |
6 | 5040210501 |
7 | 1163646253 |
oct | 304433205 |
9 | 116852321 |
10 | 51525253 |
11 | 270a275a |
12 | 15309a31 |
13 | a8a0720 |
14 | 6bb35d3 |
15 | 47cbb1d |
hex | 3123685 |
51525253 has 8 divisors (see below), whose sum is σ = 55569528. Its totient is φ = 47492544.
The previous prime is 51525247. The next prime is 51525269. The reversal of 51525253 is 35252515.
It can be written as a sum of positive squares in 4 ways, for example, as 3541924 + 47983329 = 1882^2 + 6927^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51525253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51525203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7875 + ... + 12847.
It is an arithmetic number, because the mean of its divisors is an integer number (6946191).
Almost surely, 251525253 is an apocalyptic number.
It is an amenable number.
51525253 is a deficient number, since it is larger than the sum of its proper divisors (4044275).
51525253 is a wasteful number, since it uses less digits than its factorization.
51525253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5783.
The product of its digits is 7500, while the sum is 28.
The square root of 51525253 is about 7178.1092914499. The cubic root of 51525253 is about 372.1117447663. Note that the first 3 decimals are identical.
Adding to 51525253 its reverse (35252515), we get a palindrome (86777768).
The spelling of 51525253 in words is "fifty-one million, five hundred twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •