Base | Representation |
---|---|
bin | 1100100100010… |
… | …1001001000101 |
3 | 10200012001021111 |
4 | 3021011021011 |
5 | 101443241010 |
6 | 5121445021 |
7 | 1210021213 |
oct | 311051105 |
9 | 120161244 |
10 | 52712005 |
11 | 27833345 |
12 | 157a0771 |
13 | abc7948 |
14 | 7001cb3 |
15 | 496358a |
hex | 3245245 |
52712005 has 4 divisors (see below), whose sum is σ = 63254412. Its totient is φ = 42169600.
The previous prime is 52712003. The next prime is 52712029. The reversal of 52712005 is 50021725.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36759969 + 15952036 = 6063^2 + 3994^2 .
It is not a de Polignac number, because 52712005 - 21 = 52712003 is a prime.
It is a super-2 number, since 2×527120052 = 5557110942240050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52712003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5271196 + ... + 5271205.
It is an arithmetic number, because the mean of its divisors is an integer number (15813603).
Almost surely, 252712005 is an apocalyptic number.
It is an amenable number.
52712005 is a deficient number, since it is larger than the sum of its proper divisors (10542407).
52712005 is a wasteful number, since it uses less digits than its factorization.
52712005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10542406.
The product of its (nonzero) digits is 700, while the sum is 22.
The square root of 52712005 is about 7260.3033683173. The cubic root of 52712005 is about 374.9469673153.
The spelling of 52712005 in words is "fifty-two million, seven hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •