Base | Representation |
---|---|
bin | 1100011001111… |
… | …1011110111111 |
3 | 10121220120111121 |
4 | 3012133132333 |
5 | 101310032341 |
6 | 5055131411 |
7 | 1201164040 |
oct | 306373677 |
9 | 117816447 |
10 | 52033471 |
11 | 2740a576 |
12 | 15513b67 |
13 | aa1ab49 |
14 | 6ca68c7 |
15 | 487c4d1 |
hex | 319f7bf |
52033471 has 8 divisors (see below), whose sum is σ = 59553824. Its totient is φ = 44534880.
The previous prime is 52033463. The next prime is 52033493. The reversal of 52033471 is 17433025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52033471 - 23 = 52033463 is a prime.
It is a super-3 number, since 3×520334713 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52033771) 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 7 ways as a sum of consecutive naturals, for example, 61 + ... + 10201.
It is an arithmetic number, because the mean of its divisors is an integer number (7444228).
Almost surely, 252033471 is an apocalyptic number.
52033471 is a deficient number, since it is larger than the sum of its proper divisors (7520353).
52033471 is a wasteful number, since it uses less digits than its factorization.
52033471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10881.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 52033471 is about 7213.4229738731. The cubic root of 52033471 is about 373.3311824033.
Adding to 52033471 its reverse (17433025), we get a palindrome (69466496).
It can be divided in two parts, 5 and 2033471, that added together give a square (2033476 = 14262).
The spelling of 52033471 in words is "fifty-two million, thirty-three thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •