Base | Representation |
---|---|
bin | 1100011010000011… |
… | …01010011000110000 |
3 | 122012012211101012022 |
4 | 12031001222120300 |
5 | 102120203144022 |
6 | 3020544051012 |
7 | 324031325261 |
oct | 61501523060 |
9 | 18165741168 |
10 | 6660990512 |
11 | 2908a56840 |
12 | 135a903a68 |
13 | 821cca407 |
14 | 472910968 |
15 | 28eba1c42 |
hex | 18d06a630 |
6660990512 has 80 divisors (see below), whose sum is σ = 15331161600. Its totient is φ = 2769419520.
The previous prime is 6660990499. The next prime is 6660990577. The reversal of 6660990512 is 2150990666.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62633 + ... + 131319.
It is an arithmetic number, because the mean of its divisors is an integer number (191639520).
Almost surely, 26660990512 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 6660990512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7665580800).
6660990512 is an abundant number, since it is smaller than the sum of its proper divisors (8670171088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6660990512 is a wasteful number, since it uses less digits than its factorization.
6660990512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68754 (or 68748 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 44.
The square root of 6660990512 is about 81614.8914843364. The cubic root of 6660990512 is about 1881.5377594907.
The spelling of 6660990512 in words is "six billion, six hundred sixty million, nine hundred ninety thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •