Base | Representation |
---|---|
bin | 1100010010001… |
… | …1011010000011 |
3 | 10120221202100122 |
4 | 3010203122003 |
5 | 101142302001 |
6 | 5040210455 |
7 | 1163646251 |
oct | 304433203 |
9 | 116852318 |
10 | 51525251 |
11 | 270a2758 |
12 | 15309a2b |
13 | a8a071b |
14 | 6bb35d1 |
15 | 47cbb1b |
hex | 3123683 |
51525251 has 6 divisors (see below), whose sum is σ = 52050756. Its totient is φ = 51005000.
The previous prime is 51525247. The next prime is 51525269. The reversal of 51525251 is 15252515.
It is not a de Polignac number, because 51525251 - 22 = 51525247 is a prime.
It is a super-2 number, since 2×515252512 = 5309702981226002, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51525251.
It is not an unprimeable number, because it can be changed into a prime (51524251) 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 5 ways as a sum of consecutive naturals, for example, 7676 + ... + 12726.
It is an arithmetic number, because the mean of its divisors is an integer number (8675126).
Almost surely, 251525251 is an apocalyptic number.
51525251 is a deficient number, since it is larger than the sum of its proper divisors (525505).
51525251 is an equidigital number, since it uses as much as digits as its factorization.
51525251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5253 (or 5152 counting only the distinct ones).
The product of its digits is 2500, while the sum is 26.
The square root of 51525251 is about 7178.1091521375. The cubic root of 51525251 is about 372.1117399517. Note that the first 3 decimals are identical.
Adding to 51525251 its reverse (15252515), we get a palindrome (66777766).
The spelling of 51525251 in words is "fifty-one million, five hundred twenty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •