Base | Representation |
---|---|
bin | 1100101001111… |
… | …0001010101010 |
3 | 10200212120110212 |
4 | 3022132022222 |
5 | 102041423100 |
6 | 5133341122 |
7 | 1213100264 |
oct | 312361252 |
9 | 120776425 |
10 | 53076650 |
11 | 27a62300 |
12 | 159377a2 |
13 | acc4903 |
14 | 7098b34 |
15 | 49d6635 |
hex | 329e2aa |
53076650 has 72 divisors (see below), whose sum is σ = 112409472. Its totient is φ = 18612000.
The previous prime is 53076643. The next prime is 53076679. The reversal of 53076650 is 5667035.
53076650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 187409 + ... + 187691.
Almost surely, 253076650 is an apocalyptic number.
53076650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53076650 is an abundant number, since it is smaller than the sum of its proper divisors (59332822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53076650 is a wasteful number, since it uses less digits than its factorization.
53076650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348 (or 332 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 32.
The square root of 53076650 is about 7285.3723309108. The cubic root of 53076650 is about 375.8095695200.
The spelling of 53076650 in words is "fifty-three million, seventy-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •