Base | Representation |
---|---|
bin | 1100101011000… |
… | …0011000100110 |
3 | 10201000100211120 |
4 | 3022300120212 |
5 | 102101320040 |
6 | 5135114410 |
7 | 1213530654 |
oct | 312603046 |
9 | 121010746 |
10 | 53151270 |
11 | 28003377 |
12 | 15972a06 |
13 | b01c873 |
14 | 70b7dd4 |
15 | 49ed7d0 |
hex | 32b0626 |
53151270 has 32 divisors (see below), whose sum is σ = 127800288. Its totient is φ = 14147328.
The previous prime is 53151269. The next prime is 53151281. The reversal of 53151270 is 7215135.
It is a super-2 number, since 2×531512702 = 5650115005225800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53151270.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19002 + ... + 21618.
It is an arithmetic number, because the mean of its divisors is an integer number (3993759).
Almost surely, 253151270 is an apocalyptic number.
53151270 is an abundant number, since it is smaller than the sum of its proper divisors (74649018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53151270 is a wasteful number, since it uses less digits than its factorization.
53151270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3304.
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 53151270 is about 7290.4917529615. The cubic root of 53151270 is about 375.9856028515.
The spelling of 53151270 in words is "fifty-three million, one hundred fifty-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •