Base | Representation |
---|---|
bin | 110001101110011101… |
… | …011100001101101011 |
3 | 12002211001000020101201 |
4 | 301232131130031223 |
5 | 1333322030202201 |
6 | 40310041225031 |
7 | 3600060321325 |
oct | 615635341553 |
9 | 162731006351 |
10 | 53392819051 |
11 | 20709944240 |
12 | a421192177 |
13 | 505b950170 |
14 | 282718c615 |
15 | 15c767e801 |
hex | c6e75c36b |
53392819051 has 32 divisors (see below), whose sum is σ = 63696568320. Its totient is φ = 44115926400.
The previous prime is 53392819043. The next prime is 53392819057. The reversal of 53392819051 is 15091829335.
It is not a de Polignac number, because 53392819051 - 23 = 53392819043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53392818992 and 53392819010.
It is not an unprimeable number, because it can be changed into a prime (53392819057) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4207446 + ... + 4220116.
It is an arithmetic number, because the mean of its divisors is an integer number (1990517760).
Almost surely, 253392819051 is an apocalyptic number.
53392819051 is a deficient number, since it is larger than the sum of its proper divisors (10303749269).
53392819051 is a wasteful number, since it uses less digits than its factorization.
53392819051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13147.
The product of its (nonzero) digits is 291600, while the sum is 46.
The spelling of 53392819051 in words is "fifty-three billion, three hundred ninety-two million, eight hundred nineteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •