Base | Representation |
---|---|
bin | 1011011110001000001101 |
3 | 12122202210222 |
4 | 23132020031 |
5 | 1232210424 |
6 | 144241125 |
7 | 34362506 |
oct | 13361015 |
9 | 5582728 |
10 | 3006989 |
11 | 1774217 |
12 | 10101a5 |
13 | 8138ab |
14 | 583bad |
15 | 3e5e5e |
hex | 2de20d |
3006989 has 2 divisors, whose sum is σ = 3006990. Its totient is φ = 3006988.
The previous prime is 3006973. The next prime is 3007001. The reversal of 3006989 is 9896003.
3006989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2788900 + 218089 = 1670^2 + 467^2 .
It is a cyclic number.
It is not a de Polignac number, because 3006989 - 24 = 3006973 is a prime.
It is a super-2 number, since 2×30069892 = 18083965692242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3066989) by changing a digit.
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 as a sum of consecutive naturals, namely, 1503494 + 1503495.
It is an arithmetic number, because the mean of its divisors is an integer number (1503495).
Almost surely, 23006989 is an apocalyptic number.
It is an amenable number.
3006989 is a deficient number, since it is larger than the sum of its proper divisors (1).
3006989 is an equidigital number, since it uses as much as digits as its factorization.
3006989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 3006989 is about 1734.0671843963. The cubic root of 3006989 is about 144.3368688616.
It can be divided in two parts, 30069 and 89, that multiplied together give a triangular number (2676141 = T2313).
The spelling of 3006989 in words is "three million, six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •