Base | Representation |
---|---|
bin | 1011100100001001101101 |
3 | 12201000122202 |
4 | 23210021231 |
5 | 1234003121 |
6 | 144551245 |
7 | 34524443 |
oct | 13441155 |
9 | 5630582 |
10 | 3031661 |
11 | 1790806 |
12 | 1022525 |
13 | 821ba9 |
14 | 58cb93 |
15 | 3ed40b |
hex | 2e426d |
3031661 has 4 divisors (see below), whose sum is σ = 3210012. Its totient is φ = 2853312.
The previous prime is 3031657. The next prime is 3031667. The reversal of 3031661 is 1661303.
3031661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1674436 + 1357225 = 1294^2 + 1165^2 .
It is a cyclic number.
It is not a de Polignac number, because 3031661 - 22 = 3031657 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031667) 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 in 3 ways as a sum of consecutive naturals, for example, 89150 + ... + 89183.
It is an arithmetic number, because the mean of its divisors is an integer number (802503).
Almost surely, 23031661 is an apocalyptic number.
It is an amenable number.
3031661 is a deficient number, since it is larger than the sum of its proper divisors (178351).
3031661 is a wasteful number, since it uses less digits than its factorization.
3031661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178350.
The product of its (nonzero) digits is 324, while the sum is 20.
The square root of 3031661 is about 1741.1665629686. The cubic root of 3031661 is about 144.7305499344.
Adding to 3031661 its reverse (1661303), we get a palindrome (4692964).
The spelling of 3031661 in words is "three million, thirty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •