Base | Representation |
---|---|
bin | 1000000101001101100111000… |
… | …0010111111011101010011010 |
3 | 2202120112101220022202120020202 |
4 | 2001103121300113323222122 |
5 | 1044014233323212203213 |
6 | 5333252332202022202 |
7 | 230532604242150410 |
oct | 20123316027735232 |
9 | 2676471808676222 |
10 | 568681325116058 |
11 | 15522143959a020 |
12 | 539463011a7962 |
13 | 1b54155a2b857b |
14 | a06047442d2b0 |
15 | 45b2a8dc54b58 |
hex | 20536705fba9a |
568681325116058 has 64 divisors (see below), whose sum is σ = 1110535031255040. Its totient is φ = 211780514457600.
The previous prime is 568681325115947. The next prime is 568681325116061. The reversal of 568681325116058 is 850611523186865.
It is a happy number.
568681325116058 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (65) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 568681325115985 and 568681325116003.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51983678 + ... + 61965033.
It is an arithmetic number, because the mean of its divisors is an integer number (17352109863360).
Almost surely, 2568681325116058 is an apocalyptic number.
568681325116058 is a deficient number, since it is larger than the sum of its proper divisors (541853706138982).
568681325116058 is a wasteful number, since it uses less digits than its factorization.
568681325116058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113950163.
The product of its (nonzero) digits is 82944000, while the sum is 65.
The spelling of 568681325116058 in words is "five hundred sixty-eight trillion, six hundred eighty-one billion, three hundred twenty-five million, one hundred sixteen thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •