Base | Representation |
---|---|
bin | 110001011010000011… |
… | …011010010001011011 |
3 | 12001221011210010202211 |
4 | 301122003122101123 |
5 | 1332121403413120 |
6 | 40212051135551 |
7 | 3555432252001 |
oct | 613203322133 |
9 | 161834703684 |
10 | 53050451035 |
11 | 2055366206a |
12 | a3465a45b7 |
13 | 5005a39a3a |
14 | 27d390aa71 |
15 | 15a75a225a |
hex | c5a0da45b |
53050451035 has 8 divisors (see below), whose sum is σ = 63695320416. Its totient is φ = 42417174720.
The previous prime is 53050451029. The next prime is 53050451093. The reversal of 53050451035 is 53015405035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53050451035 - 229 = 52513580123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53050450988 and 53050451006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2888194 + ... + 2906503.
It is an arithmetic number, because the mean of its divisors is an integer number (7961915052).
Almost surely, 253050451035 is an apocalyptic number.
53050451035 is a deficient number, since it is larger than the sum of its proper divisors (10644869381).
53050451035 is a wasteful number, since it uses less digits than its factorization.
53050451035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5796533.
The product of its (nonzero) digits is 22500, while the sum is 31.
The spelling of 53050451035 in words is "fifty-three billion, fifty million, four hundred fifty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •