Base | Representation |
---|---|
bin | 1100100101001… |
… | …1001000010101 |
3 | 10200021221212120 |
4 | 3021103020111 |
5 | 102002104201 |
6 | 5123010153 |
7 | 1210350234 |
oct | 311231025 |
9 | 120257776 |
10 | 52769301 |
11 | 278723a2 |
12 | 15809959 |
13 | ac17a50 |
14 | 7018b1b |
15 | 4975536 |
hex | 3253215 |
52769301 has 8 divisors (see below), whose sum is σ = 75771360. Its totient is φ = 32473392.
The previous prime is 52769281. The next prime is 52769303. The reversal of 52769301 is 10396725.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52769301 - 26 = 52769237 is a prime.
It is a super-3 number, since 3×527693013 (a number of 24 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52769303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 676491 + ... + 676568.
It is an arithmetic number, because the mean of its divisors is an integer number (9471420).
Almost surely, 252769301 is an apocalyptic number.
It is an amenable number.
52769301 is a deficient number, since it is larger than the sum of its proper divisors (23002059).
52769301 is a wasteful number, since it uses less digits than its factorization.
52769301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353075.
The product of its (nonzero) digits is 11340, while the sum is 33.
The square root of 52769301 is about 7264.2481372817. The cubic root of 52769301 is about 375.0827692855.
The spelling of 52769301 in words is "fifty-two million, seven hundred sixty-nine thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •