Base | Representation |
---|---|
bin | 10000100010001011010… |
… | …10010011101111101001 |
3 | 2000022101011122210100222 |
4 | 20101011222103233221 |
5 | 33301434211330042 |
6 | 1112552240535425 |
7 | 56021104512044 |
oct | 10210552235751 |
9 | 2008334583328 |
10 | 568104401897 |
11 | 1a9a2814066a |
12 | 92129021575 |
13 | 41758943336 |
14 | 1d6d4199c5b |
15 | eb9eb052d2 |
hex | 8445a93be9 |
568104401897 has 2 divisors, whose sum is σ = 568104401898. Its totient is φ = 568104401896.
The previous prime is 568104401849. The next prime is 568104401899. The reversal of 568104401897 is 798104401865.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 399147231961 + 168957169936 = 631781^2 + 411044^2 .
It is a cyclic number.
It is not a de Polignac number, because 568104401897 - 222 = 568100207593 is a prime.
It is a super-2 number, since 2×5681044018972 (a number of 24 digits) contains 22 as substring.
Together with 568104401899, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (568104401899) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 284052200948 + 284052200949.
It is an arithmetic number, because the mean of its divisors is an integer number (284052200949).
Almost surely, 2568104401897 is an apocalyptic number.
It is an amenable number.
568104401897 is a deficient number, since it is larger than the sum of its proper divisors (1).
568104401897 is an equidigital number, since it uses as much as digits as its factorization.
568104401897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 53.
The spelling of 568104401897 in words is "five hundred sixty-eight billion, one hundred four million, four hundred one thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •