Base | Representation |
---|---|
bin | 100000001001111… |
… | …0000001101000000 |
3 | 2210012011211000000 |
4 | 1000103300031000 |
5 | 4202200420000 |
6 | 255021000000 |
7 | 35510445234 |
oct | 10023601500 |
9 | 2705154000 |
10 | 1078920000 |
11 | 504027624 |
12 | 2613b3000 |
13 | 1426acb02 |
14 | a34125c4 |
15 | 64ac0000 |
hex | 404f0340 |
1078920000 has 490 divisors, whose sum is σ = 4119632858. Its totient is φ = 279936000.
The previous prime is 1078919969. The next prime is 1078920049. The reversal of 1078920000 is 298701.
It can be written as a sum of positive squares in 5 ways, for example, as 203233536 + 875686464 = 14256^2 + 29592^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 69 ways as a sum of consecutive naturals, for example, 29159982 + ... + 29160018.
Almost surely, 21078920000 is an apocalyptic number.
1078920000 is a gapful number since it is divisible by the number (10) 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 1078920000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2059816429).
1078920000 is an abundant number, since it is smaller than the sum of its proper divisors (3040712858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1078920000 is an frugal number, since it uses more digits than its factorization.
1078920000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87 (or 47 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 1078920000 is about 32846.9176636104. The cubic root of 1078920000 is about 1025.6434587549.
The spelling of 1078920000 in words is "one billion, seventy-eight million, nine hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •