Base | Representation |
---|---|
bin | 11000000001011101111010… |
… | …11001000111111111111101 |
3 | 20221001012200002020202021212 |
4 | 30000232331121013333331 |
5 | 23411004123421104233 |
6 | 304204214003134205 |
7 | 14061423550203032 |
oct | 1400567531077775 |
9 | 227035602222255 |
10 | 52826980253693 |
11 | 1591788417a598 |
12 | 5b12280974365 |
13 | 23627417bc769 |
14 | d08ba77a1389 |
15 | 61923e8b3a48 |
hex | 300bbd647ffd |
52826980253693 has 8 divisors (see below), whose sum is σ = 53065740715512. Its totient is φ = 52588477218816.
The previous prime is 52826980253689. The next prime is 52826980253731. The reversal of 52826980253693 is 39635208962825.
It can be written as a sum of positive squares in 4 ways, for example, as 34504839342724 + 18322140910969 = 5874082^2 + 4280437^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52826980253693 - 22 = 52826980253689 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52826980253623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63945380 + ... + 64766237.
It is an arithmetic number, because the mean of its divisors is an integer number (6633217589439).
Almost surely, 252826980253693 is an apocalyptic number.
It is an amenable number.
52826980253693 is a deficient number, since it is larger than the sum of its proper divisors (238760461819).
52826980253693 is a wasteful number, since it uses less digits than its factorization.
52826980253693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128713471.
The product of its (nonzero) digits is 335923200, while the sum is 68.
The spelling of 52826980253693 in words is "fifty-two trillion, eight hundred twenty-six billion, nine hundred eighty million, two hundred fifty-three thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •