Search a number
-
+
115229569 = 7131266259
BaseRepresentation
bin1101101111001…
…00001110000001
322000211021020211
412313210032001
5213444321234
615233434121
72566302160
oct667441601
9260737224
10115229569
115a053754
123270b941
131ab467a0
14114373d7
15a1b2164
hex6de4381

115229569 has 8 divisors (see below), whose sum is σ = 141821120. Its totient is φ = 91170576.

The previous prime is 115229567. The next prime is 115229593. The reversal of 115229569 is 965922511.

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

It is not a de Polignac number, because 115229569 - 21 = 115229567 is a prime.

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

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

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

Almost surely, 2115229569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1266279.

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

The square root of 115229569 is about 10734.5036680789. The cubic root of 115229569 is about 486.6177867861.

The spelling of 115229569 in words is "one hundred fifteen million, two hundred twenty-nine thousand, five hundred sixty-nine".

Divisors: 1 7 13 91 1266259 8863813 16461367 115229569