Base | Representation |
---|---|
bin | 110001100101100000… |
… | …001101011111011011 |
3 | 12002102120020210100000 |
4 | 301211200031133123 |
5 | 1333020043101420 |
6 | 40243112344043 |
7 | 3563254131660 |
oct | 614540153733 |
9 | 162376223300 |
10 | 53242550235 |
11 | 20642039036 |
12 | a39a9a5023 |
13 | 5036788ac4 |
14 | 2811233a67 |
15 | 15b939a690 |
hex | c6580d7db |
53242550235 has 96 divisors (see below), whose sum is σ = 109504991232. Its totient is φ = 24311041920.
The previous prime is 53242550213. The next prime is 53242550279. The reversal of 53242550235 is 53205524235.
53242550235 is a `hidden beast` number, since 5 + 32 + 42 + 550 + 2 + 35 = 666.
It is not a de Polignac number, because 53242550235 - 27 = 53242550107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53242550235.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8425297 + ... + 8431613.
It is an arithmetic number, because the mean of its divisors is an integer number (1140676992).
Almost surely, 253242550235 is an apocalyptic number.
53242550235 is an abundant number, since it is smaller than the sum of its proper divisors (56262440997).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53242550235 is an equidigital number, since it uses as much as digits as its factorization.
53242550235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7335 (or 7323 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 36.
It can be divided in two parts, 532425 and 50235, that added together give a triangular number (582660 = T1079).
The spelling of 53242550235 in words is "fifty-three billion, two hundred forty-two million, five hundred fifty thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •