Base | Representation |
---|---|
bin | 111010100110000… |
… | …1100100010000000 |
3 | 12002000121211010211 |
4 | 1311030030202000 |
5 | 13011312200303 |
6 | 523033003504 |
7 | 66502561210 |
oct | 16514144200 |
9 | 5060554124 |
10 | 1966131328 |
11 | 919914627 |
12 | 46a553594 |
13 | 254449525 |
14 | 1491a0240 |
15 | b792266d |
hex | 7530c880 |
1966131328 has 128 divisors (see below), whose sum is σ = 4904323200. Its totient is φ = 765542400.
The previous prime is 1966131317. The next prime is 1966131341. The reversal of 1966131328 is 8231316691.
It is a tau number, because it is divible by the number of its divisors (128).
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 15 ways as a sum of consecutive naturals, for example, 439503 + ... + 443953.
It is an arithmetic number, because the mean of its divisors is an integer number (38315025).
Almost surely, 21966131328 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 1966131328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2452161600).
1966131328 is an abundant number, since it is smaller than the sum of its proper divisors (2938191872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1966131328 is a wasteful number, since it uses less digits than its factorization.
1966131328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4518 (or 4506 counting only the distinct ones).
The product of its digits is 46656, while the sum is 40.
The square root of 1966131328 is about 44341.0794636306. The cubic root of 1966131328 is about 1252.7685468981.
The spelling of 1966131328 in words is "one billion, nine hundred sixty-six million, one hundred thirty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •