Base | Representation |
---|---|
bin | 1100101001100… |
… | …1010110000110 |
3 | 10200211120101110 |
4 | 3022121112012 |
5 | 102040310102 |
6 | 5133105450 |
7 | 1212655563 |
oct | 312312606 |
9 | 120746343 |
10 | 53056902 |
11 | 27a49488 |
12 | 15928286 |
13 | acb8922 |
14 | 709186a |
15 | 49d086c |
hex | 3299586 |
53056902 has 16 divisors (see below), whose sum is σ = 106751232. Its totient is φ = 17579400.
The previous prime is 53056901. The next prime is 53056909. The reversal of 53056902 is 20965035.
It is a self number, because there is not a number n which added to its sum of digits gives 53056902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53056901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25474 + ... + 27477.
It is an arithmetic number, because the mean of its divisors is an integer number (6671952).
Almost surely, 253056902 is an apocalyptic number.
53056902 is an abundant number, since it is smaller than the sum of its proper divisors (53694330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53056902 is a wasteful number, since it uses less digits than its factorization.
53056902 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53123.
The product of its (nonzero) digits is 8100, while the sum is 30.
The square root of 53056902 is about 7284.0168863066. The cubic root of 53056902 is about 375.7629551237.
The spelling of 53056902 in words is "fifty-three million, fifty-six thousand, nine hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •