Base | Representation |
---|---|
bin | 1100101010101… |
… | …1000111000110 |
3 | 10200222021012120 |
4 | 3022223013012 |
5 | 102100122140 |
6 | 5134430410 |
7 | 1213410666 |
oct | 312530706 |
9 | 120867176 |
10 | 53129670 |
11 | 27a99120 |
12 | 15962406 |
13 | b012a99 |
14 | 70b01a6 |
15 | 49e71d0 |
hex | 32ab1c6 |
53129670 has 64 divisors (see below), whose sum is σ = 140279040. Its totient is φ = 12771200.
The previous prime is 53129663. The next prime is 53129717. The reversal of 53129670 is 7692135.
53129670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 42616 + ... + 43844.
It is an arithmetic number, because the mean of its divisors is an integer number (2191860).
Almost surely, 253129670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53129670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70139520).
53129670 is an abundant number, since it is smaller than the sum of its proper divisors (87149370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53129670 is a wasteful number, since it uses less digits than its factorization.
53129670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1381.
The product of its (nonzero) digits is 11340, while the sum is 33.
The square root of 53129670 is about 7289.0102208736. The cubic root of 53129670 is about 375.9346640285.
The spelling of 53129670 in words is "fifty-three million, one hundred twenty-nine thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •