Base | Representation |
---|---|
bin | 10111111001111101011110… |
… | …10110010011010100100000 |
3 | 20220010112220020120021020010 |
4 | 23330332233112103110200 |
5 | 23342242401412013343 |
6 | 303445515301444520 |
7 | 14033662660240410 |
oct | 1374765726232440 |
9 | 226115806507203 |
10 | 52569046594848 |
11 | 1582845336aaa3 |
12 | 5a90297410740 |
13 | 2344316b77aa4 |
14 | cda4d9434640 |
15 | 612695305d33 |
hex | 2fcfaf593520 |
52569046594848 has 768 divisors, whose sum is σ = 170082997862400. Its totient is φ = 13899038883840.
The previous prime is 52569046594819. The next prime is 52569046594903. The reversal of 52569046594848 is 84849564096525.
It is a self number, because there is not a number n which added to its sum of digits gives 52569046594848.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 29384597538 + ... + 29384599326.
It is an arithmetic number, because the mean of its divisors is an integer number (221462236800).
Almost surely, 252569046594848 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 52569046594848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85041498931200).
52569046594848 is an abundant number, since it is smaller than the sum of its proper divisors (117513951267552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52569046594848 is a wasteful number, since it uses less digits than its factorization.
52569046594848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2513 (or 2505 counting only the distinct ones).
The product of its (nonzero) digits is 2985984000, while the sum is 75.
The spelling of 52569046594848 in words is "fifty-two trillion, five hundred sixty-nine billion, forty-six million, five hundred ninety-four thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •