Base | Representation |
---|---|
bin | 1100001100101… |
… | …1011101100001 |
3 | 10120021110012221 |
4 | 3003023131201 |
5 | 101044240100 |
6 | 5024351041 |
7 | 1160616112 |
oct | 303133541 |
9 | 116243187 |
10 | 51165025 |
11 | 2697704a |
12 | 15175481 |
13 | a7a5782 |
14 | 6b1c209 |
15 | 475a01a |
hex | 30cb761 |
51165025 has 12 divisors (see below), whose sum is σ = 63643372. Its totient is φ = 40803840.
The previous prime is 51165013. The next prime is 51165029. The reversal of 51165025 is 52056115.
51165025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 28224 + 51136801 = 168^2 + 7151^2 .
It is not a de Polignac number, because 51165025 - 211 = 51162977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51165029) 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 in 11 ways as a sum of consecutive naturals, for example, 5389 + ... + 11461.
Almost surely, 251165025 is an apocalyptic number.
It is an amenable number.
51165025 is a deficient number, since it is larger than the sum of its proper divisors (12478347).
51165025 is a wasteful number, since it uses less digits than its factorization.
51165025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6420 (or 6415 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 51165025 is about 7152.9731580651. The cubic root of 51165025 is about 371.2425355700.
It can be divided in two parts, 511 and 65025, that added together give a 16-th power (65536 = 216).
The spelling of 51165025 in words is "fifty-one million, one hundred sixty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •