Base | Representation |
---|---|
bin | 110001011000111110… |
… | …101111111111000011 |
3 | 12001212220220200210012 |
4 | 301120332233333003 |
5 | 1332102301431120 |
6 | 40210205255135 |
7 | 3555123255533 |
oct | 613076577703 |
9 | 161786820705 |
10 | 53032452035 |
11 | 20544489162 |
12 | a3405644ab |
13 | 50020a7344 |
14 | 27d13834c3 |
15 | 15a5be91c5 |
hex | c58faffc3 |
53032452035 has 4 divisors (see below), whose sum is σ = 63638942448. Its totient is φ = 42425961624.
The previous prime is 53032452023. The next prime is 53032452043. The reversal of 53032452035 is 53025423035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 53032452035 - 220 = 53031403459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53032451992 and 53032452010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5303245199 + ... + 5303245208.
It is an arithmetic number, because the mean of its divisors is an integer number (15909735612).
Almost surely, 253032452035 is an apocalyptic number.
53032452035 is a deficient number, since it is larger than the sum of its proper divisors (10606490413).
53032452035 is a wasteful number, since it uses less digits than its factorization.
53032452035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10606490412.
The product of its (nonzero) digits is 54000, while the sum is 32.
The spelling of 53032452035 in words is "fifty-three billion, thirty-two million, four hundred fifty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •