Base | Representation |
---|---|
bin | 10000100010101000110… |
… | …00111010110101001000 |
3 | 2000100000101121202111022 |
4 | 20101110120322311020 |
5 | 33302440441023030 |
6 | 1113032545052012 |
7 | 56030165024336 |
oct | 10212430726510 |
9 | 2010011552438 |
10 | 568351501640 |
11 | 1aa04467332a |
12 | 92197927008 |
13 | 41797bab8c0 |
14 | 1d718d1cb56 |
15 | ebb6664de5 |
hex | 845463ad48 |
568351501640 has 128 divisors (see below), whose sum is σ = 1391206924800. Its totient is φ = 207716244480.
The previous prime is 568351501637. The next prime is 568351501649. The reversal of 568351501640 is 46105153865.
It is a junction number, because it is equal to n+sod(n) for n = 568351501591 and 568351501600.
It is not an unprimeable number, because it can be changed into a prime (568351501649) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62513495 + ... + 62522585.
It is an arithmetic number, because the mean of its divisors is an integer number (10868804100).
Almost surely, 2568351501640 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 568351501640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (695603462400).
568351501640 is an abundant number, since it is smaller than the sum of its proper divisors (822855423160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
568351501640 is a wasteful number, since it uses less digits than its factorization.
568351501640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10327 (or 10323 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 44.
The spelling of 568351501640 in words is "five hundred sixty-eight billion, three hundred fifty-one million, five hundred one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •