Base | Representation |
---|---|
bin | 10000100010011011110… |
… | …01011000111101000001 |
3 | 2000022201210122121122201 |
4 | 20101031321120331001 |
5 | 33302230044314441 |
6 | 1113014054233201 |
7 | 56024403114436 |
oct | 10211571307501 |
9 | 2008653577581 |
10 | 568242573121 |
11 | 1a9a99133763 |
12 | 92167355801 |
13 | 4177b460162 |
14 | 1d708685b8d |
15 | ebabce9c31 |
hex | 844de58f41 |
568242573121 has 4 divisors (see below), whose sum is σ = 601668606852. Its totient is φ = 534816539392.
The previous prime is 568242573103. The next prime is 568242573139. The reversal of 568242573121 is 121375242865.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (568242573103) and next prime (568242573139).
It can be written as a sum of positive squares in 2 ways, for example, as 491478113025 + 76764460096 = 701055^2 + 277064^2 .
It is a cyclic number.
It is not a de Polignac number, because 568242573121 - 221 = 568240475969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (568242573421) 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, 16713016840 + ... + 16713016873.
It is an arithmetic number, because the mean of its divisors is an integer number (150417151713).
Almost surely, 2568242573121 is an apocalyptic number.
It is an amenable number.
568242573121 is a deficient number, since it is larger than the sum of its proper divisors (33426033731).
568242573121 is a wasteful number, since it uses less digits than its factorization.
568242573121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33426033730.
The product of its digits is 806400, while the sum is 46.
The spelling of 568242573121 in words is "five hundred sixty-eight billion, two hundred forty-two million, five hundred seventy-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •