Base | Representation |
---|---|
bin | 110001000001101011… |
… | …100100111110101011 |
3 | 12000212200100211100100 |
4 | 301001223210332223 |
5 | 1330302214102001 |
6 | 40103323040443 |
7 | 3542335536303 |
oct | 610153447653 |
9 | 160780324310 |
10 | 52641550251 |
11 | 20363867934 |
12 | a251670123 |
13 | 4c6c100004 |
14 | 27954aa603 |
15 | 1581731586 |
hex | c41ae4fab |
52641550251 has 24 divisors (see below), whose sum is σ = 76742939520. Its totient is φ = 34769177856.
The previous prime is 52641550249. The next prime is 52641550253. The reversal of 52641550251 is 15205514625.
52641550251 is a `hidden beast` number, since 5 + 2 + 641 + 5 + 5 + 0 + 2 + 5 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (52641550249) and next prime (52641550253).
It is not a de Polignac number, because 52641550251 - 21 = 52641550249 is a prime.
It is a super-2 number, since 2×526415502512 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52641550253) 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, 2755705 + ... + 2774741.
It is an arithmetic number, because the mean of its divisors is an integer number (3197622480).
Almost surely, 252641550251 is an apocalyptic number.
52641550251 is a deficient number, since it is larger than the sum of its proper divisors (24101389269).
52641550251 is a wasteful number, since it uses less digits than its factorization.
52641550251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21875 (or 21872 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 52641550251 in words is "fifty-two billion, six hundred forty-one million, five hundred fifty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •