Base | Representation |
---|---|
bin | 1000000100111011001000111… |
… | …0101011101011010111000101 |
3 | 2202112102001211210220202002020 |
4 | 2001032302032223223113011 |
5 | 1043444033441020404431 |
6 | 5332450453024433353 |
7 | 230500641624336066 |
oct | 20116621653532705 |
9 | 2675361753822066 |
10 | 568364006028741 |
11 | 15510990420311a |
12 | 538b4903778859 |
13 | 1b51a65a344900 |
14 | a04cd710aa56d |
15 | 45a96bad8e696 |
hex | 204ec8eaeb5c5 |
568364006028741 has 12 divisors (see below), whose sum is σ = 820596553083648. Its totient is φ = 349762465248144.
The previous prime is 568364006028739. The next prime is 568364006028781. The reversal of 568364006028741 is 147820600463865.
It is a happy number.
568364006028741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 568364006028741 - 21 = 568364006028739 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (568364006028781) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 560516770725 + ... + 560516771738.
It is an arithmetic number, because the mean of its divisors is an integer number (68383046090304).
Almost surely, 2568364006028741 is an apocalyptic number.
It is an amenable number.
568364006028741 is a deficient number, since it is larger than the sum of its proper divisors (252232547054907).
568364006028741 is a wasteful number, since it uses less digits than its factorization.
568364006028741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121033542492 (or 1121033542479 counting only the distinct ones).
The product of its (nonzero) digits is 46448640, while the sum is 60.
The spelling of 568364006028741 in words is "five hundred sixty-eight trillion, three hundred sixty-four billion, six million, twenty-eight thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •