Search a number
-
+
115490695 = 523098139
BaseRepresentation
bin1101110001000…
…11111110000111
322001022112110011
412320203332013
5214031200240
615243211051
72601440365
oct670437607
9261275404
10115490695
115a211961
1232816a87
131ac085b8
14114a4635
15a2146ea
hex6e23f87

115490695 has 4 divisors (see below), whose sum is σ = 138588840. Its totient is φ = 92392552.

The previous prime is 115490693. The next prime is 115490701. The reversal of 115490695 is 596094511.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 115490695 - 21 = 115490693 is a prime.

It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a congruent number.

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

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

Almost surely, 2115490695 is an apocalyptic number.

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

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

115490695 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 23098144.

The product of its (nonzero) digits is 48600, while the sum is 40.

The square root of 115490695 is about 10746.6597136040. The cubic root of 115490695 is about 486.9850903438.

The spelling of 115490695 in words is "one hundred fifteen million, four hundred ninety thousand, six hundred ninety-five".

Divisors: 1 5 23098139 115490695