Base | Representation |
---|---|
bin | 1000000101010110000101010… |
… | …0001101000111100000101100 |
3 | 2202121001022121101121021022002 |
4 | 2001111201110031013200230 |
5 | 1044024124423120011040 |
6 | 5333443243430311432 |
7 | 230546246252206625 |
oct | 20125412415074054 |
9 | 2677038541537262 |
10 | 568826881407020 |
11 | 1552781422a4865 |
12 | 5396a5637b8578 |
13 | 1b5521b603cba2 |
14 | a067521968a4c |
15 | 45b675c664a15 |
hex | 205585434782c |
568826881407020 has 24 divisors (see below), whose sum is σ = 1194537246621264. Its totient is φ = 227530601007296.
The previous prime is 568826881407007. The next prime is 568826881407023. The reversal of 568826881407020 is 20704188628865.
It is a super-2 number, since 2×5688268814070202 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (568826881407023) 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 in 7 ways as a sum of consecutive naturals, for example, 24229022 + ... + 41529498.
It is an arithmetic number, because the mean of its divisors is an integer number (49772385275886).
Almost surely, 2568826881407020 is an apocalyptic number.
It is an amenable number.
568826881407020 is an abundant number, since it is smaller than the sum of its proper divisors (625710365214244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
568826881407020 is a wasteful number, since it uses less digits than its factorization.
568826881407020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18944449 (or 18944447 counting only the distinct ones).
The product of its (nonzero) digits is 82575360, while the sum is 65.
The spelling of 568826881407020 in words is "five hundred sixty-eight trillion, eight hundred twenty-six billion, eight hundred eighty-one million, four hundred seven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •