Base | Representation |
---|---|
bin | 110001101110001010… |
… | …011000001111101101 |
3 | 12002210200121100211000 |
4 | 301232022120033231 |
5 | 1333314240301221 |
6 | 40305342150513 |
7 | 3600000000000 |
oct | 615612301755 |
9 | 162720540730 |
10 | 53387822061 |
11 | 207070409a2 |
12 | a41b582439 |
13 | 505a8c0872 |
14 | 282664b537 |
15 | 15c6ee3e26 |
hex | c6e2983ed |
53387822061 has 48 divisors (see below), whose sum is σ = 92275248000. Its totient is φ = 30507326892.
The previous prime is 53387822027. The next prime is 53387822071. The reversal of 53387822061 is 16022878335.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 53387822061 - 230 = 52314080237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53387821998 and 53387822016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53387822021) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 7626831720 + ... + 7626831726.
It is an arithmetic number, because the mean of its divisors is an integer number (1922401000).
Almost surely, 253387822061 is an apocalyptic number.
It is an amenable number.
53387822061 is a deficient number, since it is larger than the sum of its proper divisors (38887425939).
53387822061 is an frugal number, since it uses more digits than its factorization.
53387822061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86 (or 10 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 53387822061 in words is "fifty-three billion, three hundred eighty-seven million, eight hundred twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •