Base | Representation |
---|---|
bin | 110000011111110000… |
… | …100100011110100110 |
3 | 11222102000110201000220 |
4 | 300133300210132212 |
5 | 1323121020333244 |
6 | 35531032545210 |
7 | 3522255245100 |
oct | 603760443646 |
9 | 158360421026 |
10 | 52072433574 |
11 | 200a1593077 |
12 | a112b52206 |
13 | 4bab228495 |
14 | 273da82570 |
15 | 154b7b4319 |
hex | c1fc247a6 |
52072433574 has 96 divisors (see below), whose sum is σ = 122317848576. Its totient is φ = 14734621440.
The previous prime is 52072433537. The next prime is 52072433603. The reversal of 52072433574 is 47533427025.
52072433574 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32893987 + ... + 32895569.
It is an arithmetic number, because the mean of its divisors is an integer number (1274144256).
Almost surely, 252072433574 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52072433574, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61158924288).
52072433574 is an abundant number, since it is smaller than the sum of its proper divisors (70245415002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52072433574 is a wasteful number, since it uses less digits than its factorization.
52072433574 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2610 (or 2603 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 42.
The spelling of 52072433574 in words is "fifty-two billion, seventy-two million, four hundred thirty-three thousand, five hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •