Search a number
-
+
3690001 = 7527143
BaseRepresentation
bin1110000100111000010001
320221110201201
432010320101
51421040001
6211031201
743236010
oct16047021
96843651
103690001
1120a0397
12129b501
139c2743
146c0a77
154cd501
hex384e11

3690001 has 4 divisors (see below), whose sum is σ = 4217152. Its totient is φ = 3162852.

The previous prime is 3689993. The next prime is 3690013. The reversal of 3690001 is 1000963.

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, and also an emirpimes, since its reverse is a distinct semiprime: 1000963 = 5711753.

It is not a de Polignac number, because 3690001 - 23 = 3689993 is a prime.

It is a super-2 number, since 2×36900012 = 27232214760002, which contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263565 + ... + 263578.

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

Almost surely, 23690001 is an apocalyptic number.

It is an amenable number.

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

3690001 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 527150.

The product of its (nonzero) digits is 162, while the sum is 19.

The square root of 3690001 is about 1920.9375315194. The cubic root of 3690001 is about 154.5285850413.

Adding to 3690001 its reverse (1000963), we get a palindrome (4690964).

The spelling of 3690001 in words is "three million, six hundred ninety thousand, one".

Divisors: 1 7 527143 3690001