Base | Representation |
---|---|
bin | 11000000101110100000100… |
… | …10101000101110100000000 |
3 | 20221120111010100112012201122 |
4 | 30002322002111011310000 |
5 | 23420430442134231101 |
6 | 304400552102251412 |
7 | 14105261266234025 |
oct | 1402720225056400 |
9 | 227514110465648 |
10 | 52976313195776 |
11 | 15975145789203 |
12 | 5b371b8126b68 |
13 | 237384cac4999 |
14 | d120d271154c |
15 | 61d07eb2b51b |
hex | 302e82545d00 |
52976313195776 has 648 divisors, whose sum is σ = 121471951376160. Its totient is φ = 23021966499840.
The previous prime is 52976313195763. The next prime is 52976313195779. The reversal of 52976313195776 is 67759131367925.
It is a super-2 number, since 2×529763131957762 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52976313195779) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 172561280615 + ... + 172561280921.
Almost surely, 252976313195776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52976313195776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60735975688080).
52976313195776 is an abundant number, since it is smaller than the sum of its proper divisors (68495638180384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52976313195776 is a wasteful number, since it uses less digits than its factorization.
52976313195776 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 519 (or 455 counting only the distinct ones).
The product of its digits is 450084600, while the sum is 71.
The spelling of 52976313195776 in words is "fifty-two trillion, nine hundred seventy-six billion, three hundred thirteen million, one hundred ninety-five thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •