Base | Representation |
---|---|
bin | 1100011010011… |
… | …1110000010110 |
3 | 10121222021222101 |
4 | 3012213300112 |
5 | 101312123400 |
6 | 5055552314 |
7 | 1201364566 |
oct | 306476026 |
9 | 117867871 |
10 | 52067350 |
11 | 27432a75 |
12 | 1552b69a |
13 | aa303aa |
14 | 6cb4da6 |
15 | 488756a |
hex | 31a7c16 |
52067350 has 24 divisors (see below), whose sum is σ = 97156728. Its totient is φ = 20760000.
The previous prime is 52067329. The next prime is 52067357. The reversal of 52067350 is 5376025.
52067350 is nontrivially palindromic in base 13.
52067350 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×520673503 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52067357) 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, 15850 + ... + 18850.
It is an arithmetic number, because the mean of its divisors is an integer number (4048197).
Almost surely, 252067350 is an apocalyptic number.
52067350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
52067350 is a deficient number, since it is larger than the sum of its proper divisors (45089378).
52067350 is a wasteful number, since it uses less digits than its factorization.
52067350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3360 (or 3355 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 52067350 is about 7215.7709220845. The cubic root of 52067350 is about 373.4121901522.
The spelling of 52067350 in words is "fifty-two million, sixty-seven thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •