Base | Representation |
---|---|
bin | 110000100100110001… |
… | …111000000000000001 |
3 | 11222121212221221101101 |
4 | 300210301320000001 |
5 | 1323304101134021 |
6 | 35543242134401 |
7 | 3524330211241 |
oct | 604461700001 |
9 | 158555857341 |
10 | 52156661761 |
11 | 20135091a46 |
12 | a1371b1401 |
13 | 4bc2809249 |
14 | 274ad29b21 |
15 | 1553da0a91 |
hex | c24c78001 |
52156661761 has 8 divisors (see below), whose sum is σ = 52292908800. Its totient is φ = 52020529680.
The previous prime is 52156661743. The next prime is 52156661779. The reversal of 52156661761 is 16716665125.
It is an interprime number because it is at equal distance from previous prime (52156661743) and next prime (52156661779).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52156661761 is a prime.
It is a super-2 number, since 2×521566617612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52156661461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 920431 + ... + 975451.
It is an arithmetic number, because the mean of its divisors is an integer number (6536613600).
Almost surely, 252156661761 is an apocalyptic number.
It is an amenable number.
52156661761 is a deficient number, since it is larger than the sum of its proper divisors (136247039).
52156661761 is a wasteful number, since it uses less digits than its factorization.
52156661761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57479.
The product of its digits is 453600, while the sum is 46.
The spelling of 52156661761 in words is "fifty-two billion, one hundred fifty-six million, six hundred sixty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •