Base | Representation |
---|---|
bin | 1100011110000… |
… | …1010110011001 |
3 | 10122102021120200 |
4 | 3013201112121 |
5 | 101342201012 |
6 | 5105012413 |
7 | 1203366426 |
oct | 307412631 |
9 | 118367520 |
10 | 52303257 |
11 | 27584236 |
12 | 15624109 |
13 | aab3896 |
14 | 6d36d4d |
15 | 48d23dc |
hex | 31e1599 |
52303257 has 12 divisors (see below), whose sum is σ = 79525680. Its totient is φ = 33033528.
The previous prime is 52303247. The next prime is 52303261. The reversal of 52303257 is 75230325.
52303257 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52303257 - 24 = 52303241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52303257.
It is not an unprimeable number, because it can be changed into a prime (52303217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 152763 + ... + 153104.
It is an arithmetic number, because the mean of its divisors is an integer number (6627140).
Almost surely, 252303257 is an apocalyptic number.
52303257 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
52303257 is a deficient number, since it is larger than the sum of its proper divisors (27222423).
52303257 is a wasteful number, since it uses less digits than its factorization.
52303257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305892 (or 305889 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 27.
The square root of 52303257 is about 7232.0990728833. The cubic root of 52303257 is about 373.9752931528.
The spelling of 52303257 in words is "fifty-two million, three hundred three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •