Base | Representation |
---|---|
bin | 1011000011101000… |
… | …1000100011000000 |
3 | 21122211212111212221 |
4 | 2300322020203000 |
5 | 22034303420001 |
6 | 1210303100424 |
7 | 133356555604 |
oct | 26072104300 |
9 | 7584774787 |
10 | 2968029376 |
11 | 1293414444 |
12 | 6a9ba1714 |
13 | 383b9c600 |
14 | 202283504 |
15 | 12587b1a1 |
hex | b0e888c0 |
2968029376 has 84 divisors (see below), whose sum is σ = 6427345032. Its totient is φ = 1359181824.
The previous prime is 2968029307. The next prime is 2968029409. The reversal of 2968029376 is 6739208692.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1480791 + ... + 1482793.
Almost surely, 22968029376 is an apocalyptic number.
2968029376 is a gapful number since it is divisible by the number (26) 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 2968029376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3213672516).
2968029376 is an abundant number, since it is smaller than the sum of its proper divisors (3459315656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2968029376 is a wasteful number, since it uses less digits than its factorization.
2968029376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2178 (or 2155 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 52.
The square root of 2968029376 is about 54479.6234935595. The cubic root of 2968029376 is about 1437.1079713936.
The spelling of 2968029376 in words is "two billion, nine hundred sixty-eight million, twenty-nine thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •