Base | Representation |
---|---|
bin | 110001011000111111… |
… | …000001111001110111 |
3 | 12001212221001102110120 |
4 | 301120333001321313 |
5 | 1332102311303211 |
6 | 40210211023023 |
7 | 3555124012524 |
oct | 613077017167 |
9 | 161787042416 |
10 | 53032525431 |
11 | 20544529316 |
12 | a34059aa73 |
13 | 5002101882 |
14 | 27d13a214b |
15 | 15a5c10d06 |
hex | c58fc1e77 |
53032525431 has 16 divisors (see below), whose sum is σ = 74468787840. Its totient is φ = 33477498720.
The previous prime is 53032525339. The next prime is 53032525433. The reversal of 53032525431 is 13452523035.
It is not a de Polignac number, because 53032525431 - 27 = 53032525303 is a prime.
It is a super-2 number, since 2×530325254312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53032525392 and 53032525401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53032525433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 116700 + ... + 345953.
It is an arithmetic number, because the mean of its divisors is an integer number (4654299240).
Almost surely, 253032525431 is an apocalyptic number.
53032525431 is a deficient number, since it is larger than the sum of its proper divisors (21436262409).
53032525431 is a wasteful number, since it uses less digits than its factorization.
53032525431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464686.
The product of its (nonzero) digits is 54000, while the sum is 33.
The spelling of 53032525431 in words is "fifty-three billion, thirty-two million, five hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •