Search a number
-
+
115090701 = 3113487597
BaseRepresentation
bin1101101110000…
…10010100001101
322000120012202120
412313002110031
5213430400301
615230443153
72565153255
oct667022415
9260505676
10115090701
1159a69390
12326634b9
131aac850b
14113dc965
15a185e36
hex6dc250d

115090701 has 8 divisors (see below), whose sum is σ = 167404704. Its totient is φ = 69751920.

The previous prime is 115090691. The next prime is 115090721. The reversal of 115090701 is 107090511.

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

It is not a de Polignac number, because 115090701 - 25 = 115090669 is a prime.

It is a congruent number.

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

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

Almost surely, 2115090701 is an apocalyptic number.

115090701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 3487611.

The product of its (nonzero) digits is 315, while the sum is 24.

The square root of 115090701 is about 10728.0334171739. The cubic root of 115090701 is about 486.4222270188.

The spelling of 115090701 in words is "one hundred fifteen million, ninety thousand, seven hundred one".

Divisors: 1 3 11 33 3487597 10462791 38363567 115090701