[go: up one dir, main page]

Search a number
-
+
4012009 = 20032
BaseRepresentation
bin1111010011011111101001
321112211102221
433103133221
52011341014
6221554041
746046551
oct17233751
97484387
104012009
1122a0311
121415921
13aa6191
14766161
15543b24
hex3d37e9

4012009 has 3 divisors (see below), whose sum is σ = 4014013. Its totient is φ = 4010006.

The previous prime is 4011991. The next prime is 4012013. The reversal of 4012009 is 9002104.

The square root of 4012009 is 2003.

It is a perfect power (a square), and thus also a powerful number.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is not a de Polignac number, because 4012009 - 25 = 4011977 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 4011983 and 4012001.

It is not an unprimeable number, because it can be changed into a prime (4012069) by changing a digit.

It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1002 + ... + 3004.

Almost surely, 24012009 is an apocalyptic number.

4012009 is the 2003-rd square number.

4012009 is the 1002-nd centered octagonal number.

It is an amenable number.

4012009 is a deficient number, since it is larger than the sum of its proper divisors (2004).

4012009 is an frugal number, since it uses more digits than its factorization.

4012009 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 4006 (or 2003 counting only the distinct ones).

The product of its (nonzero) digits is 72, while the sum is 16.

The cubic root of 4012009 is about 158.8988056434.

Multiplying 4012009 by its sum of digits (16), we get a square (64192144 = 80122).

The spelling of 4012009 in words is "four million, twelve thousand, nine".

Divisors: 1 2003 4012009