Base | Representation |
---|---|
bin | 110000011101100111… |
… | …000110001101000000 |
3 | 11222022111122210120000 |
4 | 300131213012031000 |
5 | 1323032304131330 |
6 | 35523304320000 |
7 | 3521340031602 |
oct | 603547061500 |
9 | 158274583500 |
10 | 52036395840 |
11 | 20083209420 |
12 | a102a73000 |
13 | 4ba391b290 |
14 | 2738d81172 |
15 | 1548546560 |
hex | c1d9c6340 |
52036395840 has 1120 divisors, whose sum is σ = 221196286080. Its totient is φ = 11446272000.
The previous prime is 52036395823. The next prime is 52036395841. The reversal of 52036395840 is 4859363025.
52036395840 is a `hidden beast` number, since 5 + 2 + 0 + 3 + 63 + 9 + 584 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52036395841) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 374362491 + ... + 374362629.
It is an arithmetic number, because the mean of its divisors is an integer number (197496684).
Almost surely, 252036395840 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 52036395840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110598143040).
52036395840 is an abundant number, since it is smaller than the sum of its proper divisors (169159890240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52036395840 is a wasteful number, since it uses less digits than its factorization.
52036395840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293 (or 274 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 45.
The spelling of 52036395840 in words is "fifty-two billion, thirty-six million, three hundred ninety-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •