Base | Representation |
---|---|
bin | 111101010100000… |
… | …111011100110000 |
3 | 2122200122112120102 |
4 | 331110013130300 |
5 | 4101320333233 |
6 | 250024131532 |
7 | 34330444313 |
oct | 7524073460 |
9 | 2580575512 |
10 | 1028683568 |
11 | 488735210 |
12 | 248606ba8 |
13 | 135170c03 |
14 | 9a89697a |
15 | 6049a1e8 |
hex | 3d507730 |
1028683568 has 40 divisors (see below), whose sum is σ = 2185373520. Its totient is φ = 465194240.
The previous prime is 1028683567. The next prime is 1028683597. The reversal of 1028683568 is 8653868201.
1028683568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (1028683561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19838 + ... + 49506.
It is an arithmetic number, because the mean of its divisors is an integer number (54634338).
Almost surely, 21028683568 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 1028683568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1092686760).
1028683568 is an abundant number, since it is smaller than the sum of its proper divisors (1156689952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1028683568 is a wasteful number, since it uses less digits than its factorization.
1028683568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29885 (or 29879 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 47.
The square root of 1028683568 is about 32073.0972623475. The cubic root of 1028683568 is about 1009.4712024568.
The spelling of 1028683568 in words is "one billion, twenty-eight million, six hundred eighty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •