Base | Representation |
---|---|
bin | 1011101100110000101100 |
3 | 12202211000210 |
4 | 23230300230 |
5 | 1241120144 |
6 | 145422420 |
7 | 35032320 |
oct | 13546054 |
9 | 5684023 |
10 | 3066924 |
11 | 1805253 |
12 | 103aa10 |
13 | 834c63 |
14 | 59b980 |
15 | 408ab9 |
hex | 2ecc2c |
3066924 has 48 divisors (see below), whose sum is σ = 8467200. Its totient is φ = 845376.
The previous prime is 3066911. The next prime is 3066971. The reversal of 3066924 is 4296603.
3066924 = T280 + T281 + ... + T342.
3066924 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3066891 and 3066900.
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, 1807 + ... + 3065.
It is an arithmetic number, because the mean of its divisors is an integer number (176400).
Almost surely, 23066924 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 3066924, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4233600).
3066924 is an abundant number, since it is smaller than the sum of its proper divisors (5400276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3066924 is a wasteful number, since it uses less digits than its factorization.
3066924 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1302 (or 1300 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 30.
The square root of 3066924 is about 1751.2635438448. The cubic root of 3066924 is about 145.2895364106.
The spelling of 3066924 in words is "three million, sixty-six thousand, nine hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •