Base | Representation |
---|---|
bin | 1100011001100… |
… | …1010111110001 |
3 | 10121212022011021 |
4 | 3012121113301 |
5 | 101303232213 |
6 | 5054415441 |
7 | 1201031041 |
oct | 306312761 |
9 | 117768137 |
10 | 52008433 |
11 | 273a2784 |
12 | 15501581 |
13 | aa0c629 |
14 | 6c9b721 |
15 | 4874d8d |
hex | 31995f1 |
52008433 has 4 divisors (see below), whose sum is σ = 52060788. Its totient is φ = 51956080.
The previous prime is 52008427. The next prime is 52008449. The reversal of 52008433 is 33480025.
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 15864289 + 36144144 = 3983^2 + 6012^2 .
It is a cyclic number.
It is not a de Polignac number, because 52008433 - 217 = 51877361 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52008398 and 52008407.
It is not an unprimeable number, because it can be changed into a prime (52008413) 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, 24658 + ... + 26683.
It is an arithmetic number, because the mean of its divisors is an integer number (13015197).
Almost surely, 252008433 is an apocalyptic number.
It is an amenable number.
52008433 is a deficient number, since it is larger than the sum of its proper divisors (52355).
52008433 is a wasteful number, since it uses less digits than its factorization.
52008433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52354.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 52008433 is about 7211.6872505677. The cubic root of 52008433 is about 373.2712916851.
Adding to 52008433 its reverse (33480025), we get a palindrome (85488458).
It can be divided in two parts, 52008 and 433, that added together give a square (52441 = 2292).
The spelling of 52008433 in words is "fifty-two million, eight thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •