Base | Representation |
---|---|
bin | 110000110101110010… |
… | …110111001001101100 |
3 | 12000100210010101102221 |
4 | 300311302313021230 |
5 | 1324400141224400 |
6 | 40031440525124 |
7 | 3534364530220 |
oct | 606562671154 |
9 | 160323111387 |
10 | 52442133100 |
11 | 20271242875 |
12 | a1b69207a4 |
13 | 4c399bb0b6 |
14 | 2776bda780 |
15 | 156de8ec1a |
hex | c35cb726c |
52442133100 has 72 divisors (see below), whose sum is σ = 132188671328. Its totient is φ = 17685388800.
The previous prime is 52442133071. The next prime is 52442133101. The reversal of 52442133100 is 133124425.
It is a super-2 number, since 2×524421331002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (52442133101) 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 23 ways as a sum of consecutive naturals, for example, 571377 + ... + 656776.
Almost surely, 252442133100 is an apocalyptic number.
52442133100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52442133100 is an abundant number, since it is smaller than the sum of its proper divisors (79746538228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52442133100 is a wasteful number, since it uses less digits than its factorization.
52442133100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228235 (or 1228228 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 52442133100 its reverse (133124425), we get a palindrome (52575257525).
The spelling of 52442133100 in words is "fifty-two billion, four hundred forty-two million, one hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •