Base | Representation |
---|---|
bin | 1100100011100… |
… | …1011111110001 |
3 | 10200002121211211 |
4 | 3020321133301 |
5 | 101440224210 |
6 | 5120440121 |
7 | 1206432151 |
oct | 310713761 |
9 | 120077754 |
10 | 52664305 |
11 | 27800521 |
12 | 15779041 |
13 | abac015 |
14 | 6dcc761 |
15 | 495438a |
hex | 32397f1 |
52664305 has 4 divisors (see below), whose sum is σ = 63197172. Its totient is φ = 42131440.
The previous prime is 52664281. The next prime is 52664309. The reversal of 52664305 is 50346625.
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 19070689 + 33593616 = 4367^2 + 5796^2 .
It is a de Polignac number, because none of the positive numbers 2k-52664305 is a prime.
It is a super-2 number, since 2×526643052 = 5547058042266050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) 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 not an unprimeable number, because it can be changed into a prime (52664309) 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, 5266426 + ... + 5266435.
It is an arithmetic number, because the mean of its divisors is an integer number (15799293).
Almost surely, 252664305 is an apocalyptic number.
It is an amenable number.
52664305 is a deficient number, since it is larger than the sum of its proper divisors (10532867).
52664305 is a wasteful number, since it uses less digits than its factorization.
52664305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10532866.
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 52664305 is about 7257.0176381210. The cubic root of 52664305 is about 374.8338345298.
The spelling of 52664305 in words is "fifty-two million, six hundred sixty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •