Base | Representation |
---|---|
bin | 110001011011100111… |
… | …100101111000011101 |
3 | 12002000000012101101210 |
4 | 301123213211320131 |
5 | 1332200114303424 |
6 | 40214430055033 |
7 | 3556201421316 |
oct | 613347457035 |
9 | 162000171353 |
10 | 53076712989 |
11 | 2056746a063 |
12 | a35334a479 |
13 | 500b303461 |
14 | 27d71c560d |
15 | 15a9a3d729 |
hex | c5b9e5e1d |
53076712989 has 16 divisors (see below), whose sum is σ = 72589024640. Its totient is φ = 34485082560.
The previous prime is 53076712937. The next prime is 53076713017. The reversal of 53076712989 is 98921767035.
It is not a de Polignac number, because 53076712989 - 213 = 53076704797 is a prime.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53076712919) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1310497 + ... + 1350390.
It is an arithmetic number, because the mean of its divisors is an integer number (4536814040).
Almost surely, 253076712989 is an apocalyptic number.
It is an amenable number.
53076712989 is a deficient number, since it is larger than the sum of its proper divisors (19512311651).
53076712989 is a wasteful number, since it uses less digits than its factorization.
53076712989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2661060.
The product of its (nonzero) digits is 5715360, while the sum is 57.
The spelling of 53076712989 in words is "fifty-three billion, seventy-six million, seven hundred twelve thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •