Base | Representation |
---|---|
bin | 10110111010100011001110 |
3 | 102022012001010 |
4 | 112322203032 |
5 | 3014210430 |
6 | 332430050 |
7 | 102026043 |
oct | 26724316 |
9 | 12265033 |
10 | 6006990 |
11 | 3433160 |
12 | 2018326 |
13 | 1324242 |
14 | b251ca |
15 | 7d9cb0 |
hex | 5ba8ce |
6006990 has 64 divisors (see below), whose sum is σ = 15966720. Its totient is φ = 1434240.
The previous prime is 6006961. The next prime is 6006991. The reversal of 6006990 is 996006.
6006990 = T276 + T277 + ... + T384.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6006991) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 35887 + ... + 36053.
It is an arithmetic number, because the mean of its divisors is an integer number (249480).
Almost surely, 26006990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6006990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7983360).
6006990 is an abundant number, since it is smaller than the sum of its proper divisors (9959730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6006990 is a wasteful number, since it uses less digits than its factorization.
6006990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297.
The product of its (nonzero) digits is 2916, while the sum is 30.
The square root of 6006990 is about 2450.9161552366. The cubic root of 6006990 is about 181.7825967479.
It can be divided in two parts, 6006 and 990, that added together give a palindrome (6996).
The spelling of 6006990 in words is "six million, six thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •