Base | Representation |
---|---|
bin | 11000000101000111100101… |
… | …11011110001011000000000 |
3 | 20221111012111001221020112020 |
4 | 30002203302323301120000 |
5 | 23420033040220030341 |
6 | 304342002310001440 |
7 | 14103454433321550 |
oct | 1402436273613000 |
9 | 227435431836466 |
10 | 52952432580096 |
11 | 159660007a7195 |
12 | 5b32652646280 |
13 | 237151546826a |
14 | d10ca8cb1160 |
15 | 61c63336d566 |
hex | 3028f2ef1600 |
52952432580096 has 160 divisors (see below), whose sum is σ = 165153472501248. Its totient is φ = 14760259829760.
The previous prime is 52952432580059. The next prime is 52952432580097. The reversal of 52952432580096 is 69008523425925.
It is a super-2 number, since 2×529524325800962 (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 (52952432580097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59618820 + ... + 60500483.
Almost surely, 252952432580096 is an apocalyptic number.
52952432580096 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
52952432580096 is an abundant number, since it is smaller than the sum of its proper divisors (112201039921152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52952432580096 is a wasteful number, since it uses less digits than its factorization.
52952432580096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120119372 (or 120119356 counting only the distinct ones).
The product of its (nonzero) digits is 46656000, while the sum is 60.
The spelling of 52952432580096 in words is "fifty-two trillion, nine hundred fifty-two billion, four hundred thirty-two million, five hundred eighty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •