Search a number
-
+
3049013 = 11277183
BaseRepresentation
bin1011101000011000110101
312201220110102
423220120311
51240032023
6145203445
734626152
oct13503065
95656412
103049013
1117a2850
121030585
13829a66
14595229
15403628
hex2e8635

3049013 has 4 divisors (see below), whose sum is σ = 3326208. Its totient is φ = 2771820.

The previous prime is 3049009. The next prime is 3049019. The reversal of 3049013 is 3109403.

3049013 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 3049013 - 22 = 3049009 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 (3049019) 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, 138581 + ... + 138602.

It is an arithmetic number, because the mean of its divisors is an integer number (831552).

Almost surely, 23049013 is an apocalyptic number.

It is an amenable number.

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

3049013 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 277194.

The product of its (nonzero) digits is 324, while the sum is 20.

The square root of 3049013 is about 1746.1423195146. The cubic root of 3049013 is about 145.0061511461.

It can be divided in two parts, 30490 and 13, that added together give a palindrome (30503).

The spelling of 3049013 in words is "three million, forty-nine thousand, thirteen".

Divisors: 1 11 277183 3049013