Base | Representation |
---|---|
bin | 110000110111110011… |
… | …000101101001010101 |
3 | 12000110010101010220112 |
4 | 300313303011221111 |
5 | 1324432242400101 |
6 | 40035041212405 |
7 | 3535253326514 |
oct | 606763055125 |
9 | 160403333815 |
10 | 52475746901 |
11 | 20289211376 |
12 | a206031105 |
13 | 4c43959c16 |
14 | 277b46a67b |
15 | 1571dce6bb |
hex | c37cc5a55 |
52475746901 has 32 divisors (see below), whose sum is σ = 55845081600. Its totient is φ = 49255335360.
The previous prime is 52475746889. The next prime is 52475746903. The reversal of 52475746901 is 10964757425.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52475746901 is a prime.
It is a super-2 number, since 2×524757469012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52475746901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52475746903) 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 31 ways as a sum of consecutive naturals, for example, 23625971 + ... + 23628191.
It is an arithmetic number, because the mean of its divisors is an integer number (1745158800).
Almost surely, 252475746901 is an apocalyptic number.
It is an amenable number.
52475746901 is a deficient number, since it is larger than the sum of its proper divisors (3369334699).
52475746901 is a wasteful number, since it uses less digits than its factorization.
52475746901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2529.
The product of its (nonzero) digits is 2116800, while the sum is 50.
The spelling of 52475746901 in words is "fifty-two billion, four hundred seventy-five million, seven hundred forty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •