Search a number
-
+
390115001 = 2631483327
BaseRepresentation
bin10111010000001…
…010111010111001
31000012001220011202
4113100022322321
51244332140001
6102413303545
712444631343
oct2720127271
91005056152
10390115001
111902341a1
12aa794bb5
1362a901a3
1439b50293
15243ae96b
hex1740aeb9

390115001 has 4 divisors (see below), whose sum is σ = 391598592. Its totient is φ = 388631412.

The previous prime is 390114971. The next prime is 390115007. The reversal of 390115001 is 100511093.

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 390115001 - 214 = 390098617 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (390115007) 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, 741401 + ... + 741926.

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

Almost surely, 2390115001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1483590.

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

The square root of 390115001 is about 19751.3290945192. The cubic root of 390115001 is about 730.6861634956.

Adding to 390115001 its reverse (100511093), we get a palindrome (490626094).

The spelling of 390115001 in words is "three hundred ninety million, one hundred fifteen thousand, one".

Divisors: 1 263 1483327 390115001