Base | Representation |
---|---|
bin | 111010101001110… |
… | …0000000000000000 |
3 | 12002011020002200120 |
4 | 1311103200000000 |
5 | 13012304433310 |
6 | 523142020240 |
7 | 66525054450 |
oct | 16523400000 |
9 | 5064202616 |
10 | 1968046080 |
11 | 91aa02170 |
12 | 46b117680 |
13 | 254969c10 |
14 | 14953bd60 |
15 | b7b9eb70 |
hex | 754e0000 |
1968046080 has 576 divisors, whose sum is σ = 8455684608. Its totient is φ = 377487360.
The previous prime is 1968046079. The next prime is 1968046127. The reversal of 1968046080 is 806408691.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151388154 + ... + 151388166.
It is an arithmetic number, because the mean of its divisors is an integer number (14680008).
Almost surely, 21968046080 is an apocalyptic number.
1968046080 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 1968046080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4227842304).
1968046080 is an abundant number, since it is smaller than the sum of its proper divisors (6487638528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1968046080 is an equidigital number, since it uses as much as digits as its factorization.
1968046080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 42.
The square root of 1968046080 is about 44362.6653843071. The cubic root of 1968046080 is about 1253.1750919377.
The spelling of 1968046080 in words is "one billion, nine hundred sixty-eight million, forty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •