Base | Representation |
---|---|
bin | 110001011010101101… |
… | …111000000101100001 |
3 | 12001221221201201020021 |
4 | 301122231320011201 |
5 | 1332132231130301 |
6 | 40213125513441 |
7 | 3555626005204 |
oct | 613255700541 |
9 | 161857651207 |
10 | 53061583201 |
11 | 20559975900 |
12 | a34a272881 |
13 | 5008136a13 |
14 | 27d51a793b |
15 | 15a85508a1 |
hex | c5ab78161 |
53061583201 has 27 divisors (see below), whose sum is σ = 59834665233. Its totient is φ = 47019246120.
The previous prime is 53061583199. The next prime is 53061583213. The reversal of 53061583201 is 10238516035.
The square root of 53061583201 is 230351.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 53061583201 - 21 = 53061583199 is a prime.
It is a super-2 number, since 2×530615832012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53061583231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 108955780 + ... + 108956266.
Almost surely, 253061583201 is an apocalyptic number.
53061583201 is the 230351-st square number.
53061583201 is the 115176-th centered octagonal number.
It is an amenable number.
53061583201 is a deficient number, since it is larger than the sum of its proper divisors (6773082032).
53061583201 is an frugal number, since it uses more digits than its factorization.
53061583201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082 (or 541 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 53061583201 in words is "fifty-three billion, sixty-one million, five hundred eighty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •