Base | Representation |
---|---|
bin | 1100011111111… |
… | …1101011101101 |
3 | 10122122121000022 |
4 | 3013333223231 |
5 | 101410140001 |
6 | 5111411525 |
7 | 1204424600 |
oct | 307775355 |
9 | 118577008 |
10 | 52427501 |
11 | 27659615 |
12 | 15683ba5 |
13 | ab282b9 |
14 | 6d6a337 |
15 | 490911b |
hex | 31ffaed |
52427501 has 6 divisors (see below), whose sum is σ = 60987150. Its totient is φ = 44937816.
The previous prime is 52427491. The next prime is 52427519. The reversal of 52427501 is 10572425.
It can be written as a sum of positive squares in only one way, i.e., 47251876 + 5175625 = 6874^2 + 2275^2 .
It is not a de Polignac number, because 52427501 - 26 = 52427437 is a prime.
It is a super-2 number, since 2×524275012 = 5497285722210002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52427581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 534926 + ... + 535023.
It is an arithmetic number, because the mean of its divisors is an integer number (10164525).
Almost surely, 252427501 is an apocalyptic number.
It is an amenable number.
52427501 is a deficient number, since it is larger than the sum of its proper divisors (8559649).
52427501 is a wasteful number, since it uses less digits than its factorization.
52427501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069963 (or 1069956 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 26.
The square root of 52427501 is about 7240.6837384324. The cubic root of 52427501 is about 374.2711794020.
Adding to 52427501 its reverse (10572425), we get a palindrome (62999926).
The spelling of 52427501 in words is "fifty-two million, four hundred twenty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •