Base | Representation |
---|---|
bin | 11000000111010011011101… |
… | …10010101111000110000011 |
3 | 20221202101022101121221202201 |
4 | 30003221232302233012003 |
5 | 23422300332401432100 |
6 | 304440301513454031 |
7 | 14112053334524665 |
oct | 1403515662570603 |
9 | 227671271557681 |
10 | 53027525030275 |
11 | 15994935500474 |
12 | 5b4510aa11317 |
13 | 2378621940733 |
14 | d1478dd72535 |
15 | 61e57aa9836a |
hex | 303a6ecaf183 |
53027525030275 has 12 divisors (see below), whose sum is σ = 65756862097272. Its totient is φ = 42420258050240.
The previous prime is 53027525030149. The next prime is 53027525030279. The reversal of 53027525030275 is 57203052572035.
53027525030275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53027525030275 - 225 = 53027491475843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53027525030279) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 43435234 + ... + 44639383.
It is an arithmetic number, because the mean of its divisors is an integer number (5479738508106).
Almost surely, 253027525030275 is an apocalyptic number.
53027525030275 is a deficient number, since it is larger than the sum of its proper divisors (12729337066997).
53027525030275 is a wasteful number, since it uses less digits than its factorization.
53027525030275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88098710 (or 88098705 counting only the distinct ones).
The product of its (nonzero) digits is 2205000, while the sum is 46.
The spelling of 53027525030275 in words is "fifty-three trillion, twenty-seven billion, five hundred twenty-five million, thirty thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •