Base | Representation |
---|---|
bin | 10111111110010010010011… |
… | …10100101100110000011101 |
3 | 20220122202111212100100110211 |
4 | 23333021021310230300131 |
5 | 23402211240242031220 |
6 | 304042054551532421 |
7 | 14050503636116266 |
oct | 1377111164546035 |
9 | 226582455310424 |
10 | 52717667142685 |
11 | 15885489834336 |
12 | 5ab505408a111 |
13 | 23553406c135c |
14 | d0379790196d |
15 | 616492c4db5a |
hex | 2ff249d2cc1d |
52717667142685 has 8 divisors (see below), whose sum is σ = 63261332187480. Its totient is φ = 42174045969984.
The previous prime is 52717667142631. The next prime is 52717667142703. The reversal of 52717667142685 is 58624176671725.
It can be written as a sum of positive squares in 4 ways, for example, as 765199809049 + 51952467333636 = 874757^2 + 7207806^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52717667142685 - 221 = 52717665045533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52717667142685.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8263842 + ... + 13180531.
It is an arithmetic number, because the mean of its divisors is an integer number (7907666523435).
Almost surely, 252717667142685 is an apocalyptic number.
It is an amenable number.
52717667142685 is a deficient number, since it is larger than the sum of its proper divisors (10543665044795).
52717667142685 is a wasteful number, since it uses less digits than its factorization.
52717667142685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21936047.
The product of its digits is 237081600, while the sum is 67.
The spelling of 52717667142685 in words is "fifty-two trillion, seven hundred seventeen billion, six hundred sixty-seven million, one hundred forty-two thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.491 sec. • engine limits •