Search a number
-
+
115102001 = 7110914827
BaseRepresentation
bin1101101110001…
…01000100110001
322000120210021002
412313011010301
5213431231001
615231011345
72565231230
oct667050461
9260523232
10115102001
1159a76923
1232669b55
131ab006c1
1411402b17
15a18946b
hex6dc5131

115102001 has 8 divisors (see below), whose sum is σ = 131672640. Its totient is φ = 98563248.

The previous prime is 115101997. The next prime is 115102003. The reversal of 115102001 is 100201511.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 115102001 - 22 = 115101997 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350 + ... + 15176.

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

Almost surely, 2115102001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15943.

The product of its (nonzero) digits is 10, while the sum is 11.

The square root of 115102001 is about 10728.5600618163. The cubic root of 115102001 is about 486.4381460324.

Adding to 115102001 its reverse (100201511), we get a palindrome (215303512).

The spelling of 115102001 in words is "one hundred fifteen million, one hundred two thousand, one".

Divisors: 1 7 1109 7763 14827 103789 16443143 115102001