Base | Representation |
---|---|
bin | 1100101001101… |
… | …1010110111010 |
3 | 10200211222200210 |
4 | 3022123112322 |
5 | 102041041041 |
6 | 5133211550 |
7 | 1213021611 |
oct | 312332672 |
9 | 120758623 |
10 | 53065146 |
11 | 27a546a2 |
12 | 15930bb6 |
13 | acbc5c4 |
14 | 7094878 |
15 | 49d3016 |
hex | 329b5ba |
53065146 has 8 divisors (see below), whose sum is σ = 106130304. Its totient is φ = 17688380.
The previous prime is 53065127. The next prime is 53065147. The reversal of 53065146 is 64156035.
It is a sphenic number, since it is the product of 3 distinct primes.
53065146 is an admirable number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (53065147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4422090 + ... + 4422101.
It is an arithmetic number, because the mean of its divisors is an integer number (13266288).
Almost surely, 253065146 is an apocalyptic number.
53065146 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53065146 is a wasteful number, since it uses less digits than its factorization.
53065146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8844196.
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 53065146 is about 7284.5827608724. The cubic root of 53065146 is about 375.7824161756.
The spelling of 53065146 in words is "fifty-three million, sixty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •