Base | Representation |
---|---|
bin | 110001011010001001… |
… | …110011000010110101 |
3 | 12001221021221012112001 |
4 | 301122021303002311 |
5 | 1332122321002430 |
6 | 40212151055301 |
7 | 3555452424301 |
oct | 613211630265 |
9 | 161837835461 |
10 | 53052125365 |
11 | 205545a6008 |
12 | a347071531 |
13 | 50061a4b75 |
14 | 27d3c24d01 |
15 | 15a77d33ca |
hex | c5a2730b5 |
53052125365 has 16 divisors (see below), whose sum is σ = 64179264240. Its totient is φ = 42098434560.
The previous prime is 53052125317. The next prime is 53052125383. The reversal of 53052125365 is 56352125035.
It can be written as a sum of positive squares in 8 ways, for example, as 7135349841 + 45916775524 = 84471^2 + 214282^2 .
It is not a de Polignac number, because 53052125365 - 211 = 53052123317 is a prime.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 276697 + ... + 427393.
It is an arithmetic number, because the mean of its divisors is an integer number (4011204015).
Almost surely, 253052125365 is an apocalyptic number.
It is an amenable number.
53052125365 is a deficient number, since it is larger than the sum of its proper divisors (11127138875).
53052125365 is a wasteful number, since it uses less digits than its factorization.
53052125365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151272.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 53052125365 in words is "fifty-three billion, fifty-two million, one hundred twenty-five thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •