Base | Representation |
---|---|
bin | 100000000011111… |
… | …1101011110110000 |
3 | 2202222100202110210 |
4 | 1000013331132300 |
5 | 4200403004111 |
6 | 254430424120 |
7 | 35442251460 |
oct | 10007753660 |
9 | 2688322423 |
10 | 1075828656 |
11 | 502305aa1 |
12 | 260362040 |
13 | 141b69a06 |
14 | a2c49ba0 |
15 | 646ae0a6 |
hex | 401fd7b0 |
1075828656 has 80 divisors (see below), whose sum is σ = 3230150400. Its totient is φ = 302164224.
The previous prime is 1075828603. The next prime is 1075828661. The reversal of 1075828656 is 6568285701.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7311 + ... + 46958.
It is an arithmetic number, because the mean of its divisors is an integer number (40376880).
Almost surely, 21075828656 is an apocalyptic number.
1075828656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1075828656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1615075200).
1075828656 is an abundant number, since it is smaller than the sum of its proper divisors (2154321744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1075828656 is a wasteful number, since it uses less digits than its factorization.
1075828656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54346 (or 54340 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 48.
The square root of 1075828656 is about 32799.8270727149. The cubic root of 1075828656 is about 1024.6629567238.
The spelling of 1075828656 in words is "one billion, seventy-five million, eight hundred twenty-eight thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •