Base | Representation |
---|---|
bin | 100001110111001… |
… | …011100110000101 |
3 | 1110121000011021021 |
4 | 201313023212011 |
5 | 2130414113131 |
6 | 132212351141 |
7 | 20035612462 |
oct | 4167134605 |
9 | 1417004237 |
10 | 568113541 |
11 | 27175a126 |
12 | 13a3154b1 |
13 | 90913078 |
14 | 55646669 |
15 | 34d1ee11 |
hex | 21dcb985 |
568113541 has 4 divisors (see below), whose sum is σ = 568350432. Its totient is φ = 567876652.
The previous prime is 568113527. The next prime is 568113563. The reversal of 568113541 is 145311865.
568113541 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-568113541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 568113497 and 568113506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (568113571) 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, 114811 + ... + 119656.
It is an arithmetic number, because the mean of its divisors is an integer number (142087608).
Almost surely, 2568113541 is an apocalyptic number.
It is an amenable number.
568113541 is a deficient number, since it is larger than the sum of its proper divisors (236891).
568113541 is a wasteful number, since it uses less digits than its factorization.
568113541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236890.
The product of its digits is 14400, while the sum is 34.
The square root of 568113541 is about 23835.1324938629. The cubic root of 568113541 is about 828.2187284367.
The spelling of 568113541 in words is "five hundred sixty-eight million, one hundred thirteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •