Base | Representation |
---|---|
bin | 11000000011001101010111… |
… | …10110110111100100110101 |
3 | 20221020221010010000102202011 |
4 | 30001212223312313210311 |
5 | 23412444144243243442 |
6 | 304251511230244221 |
7 | 14065642410241405 |
oct | 1401465366674465 |
9 | 227227103012664 |
10 | 52886815602997 |
11 | 159401997190a2 |
12 | 5b2199b656671 |
13 | 23682890bb3ac |
14 | d0ba42434805 |
15 | 61aa92941117 |
hex | 3019abdb7935 |
52886815602997 has 4 divisors (see below), whose sum is σ = 52886891142540. Its totient is φ = 52886740063456.
The previous prime is 52886815602979. The next prime is 52886815603003. The reversal of 52886815602997 is 79920651868825.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34878072046756 + 18008743556241 = 5905766^2 + 4243671^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52886815602997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52886815602947) 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, 36709672 + ... + 38123137.
It is an arithmetic number, because the mean of its divisors is an integer number (13221722785635).
Almost surely, 252886815602997 is an apocalyptic number.
It is an amenable number.
52886815602997 is a deficient number, since it is larger than the sum of its proper divisors (75539543).
52886815602997 is an equidigital number, since it uses as much as digits as its factorization.
52886815602997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75539542.
The product of its (nonzero) digits is 1045094400, while the sum is 76.
The spelling of 52886815602997 in words is "fifty-two trillion, eight hundred eighty-six billion, eight hundred fifteen million, six hundred two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •