Base | Representation |
---|---|
bin | 110000100111100011… |
… | …101001111001101001 |
3 | 11222202010122122220000 |
4 | 300213203221321221 |
5 | 1323403014000031 |
6 | 35552025053213 |
7 | 3525434302512 |
oct | 604743517151 |
9 | 158663578800 |
10 | 52203265641 |
11 | 2015942314a |
12 | a14a927209 |
13 | 4bcc3758c7 |
14 | 27531bba09 |
15 | 15580093e6 |
hex | c278e9e69 |
52203265641 has 80 divisors (see below), whose sum is σ = 81727574016. Its totient is φ = 33169500000.
The previous prime is 52203265633. The next prime is 52203265651. The reversal of 52203265641 is 14656230225.
52203265641 is a `hidden beast` number, since 5 + 2 + 2 + 0 + 3 + 2 + 6 + 5 + 641 = 666.
It is not a de Polignac number, because 52203265641 - 23 = 52203265633 is a prime.
It is a super-2 number, since 2×522032656412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52203265596 and 52203265605.
It is not an unprimeable number, because it can be changed into a prime (52203265651) 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 79 ways as a sum of consecutive naturals, for example, 49669566 + ... + 49670616.
Almost surely, 252203265641 is an apocalyptic number.
It is an amenable number.
52203265641 is a deficient number, since it is larger than the sum of its proper divisors (29524308375).
52203265641 is a wasteful number, since it uses less digits than its factorization.
52203265641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376 (or 1367 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 52203265641 its reverse (14656230225), we get a palindrome (66859495866).
The spelling of 52203265641 in words is "fifty-two billion, two hundred three million, two hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •