Base | Representation |
---|---|
bin | 110000111010010001… |
… | …011001001011001111 |
3 | 12000120000110111111010 |
4 | 300322101121023033 |
5 | 1330023403330042 |
6 | 40043122500303 |
7 | 3536266136226 |
oct | 607221311317 |
9 | 160500414433 |
10 | 52517245647 |
11 | 202aa685a59 |
12 | a217b04693 |
13 | 4c4c4299a9 |
14 | 2782b8dcbd |
15 | 157587a59c |
hex | c3a4592cf |
52517245647 has 4 divisors (see below), whose sum is σ = 70022994200. Its totient is φ = 35011497096.
The previous prime is 52517245603. The next prime is 52517245673. The reversal of 52517245647 is 74654271525.
52517245647 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 52517245647 - 230 = 51443503823 is a prime.
It is a super-2 number, since 2×525172456472 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52517245596 and 52517245605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52517245747) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8752874272 + ... + 8752874277.
It is an arithmetic number, because the mean of its divisors is an integer number (17505748550).
Almost surely, 252517245647 is an apocalyptic number.
52517245647 is a deficient number, since it is larger than the sum of its proper divisors (17505748553).
52517245647 is a wasteful number, since it uses less digits than its factorization.
52517245647 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17505748552.
The product of its digits is 2352000, while the sum is 48.
The spelling of 52517245647 in words is "fifty-two billion, five hundred seventeen million, two hundred forty-five thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •