Search a number
-
+
115051013 = 71131157307
BaseRepresentation
bin1101101101110…
…00101000000101
322000111012022122
412312320220011
5213423113023
615225535325
72564626460
oct666705005
9260435278
10115051013
1159a41590
1232644545
131aab342c
14113cc2d7
15a1792c8
hex6db8a05

115051013 has 32 divisors (see below), whose sum is σ = 149495808. Its totient is φ = 85924800.

The previous prime is 115051009. The next prime is 115051039. The reversal of 115051013 is 310150511.

It is a cyclic number.

It is not a de Polignac number, because 115051013 - 22 = 115051009 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 115050982 and 115051000.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115051073) 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 31 ways as a sum of consecutive naturals, for example, 374606 + ... + 374912.

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

Almost surely, 2115051013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 513.

The product of its (nonzero) digits is 75, while the sum is 17.

The square root of 115051013 is about 10726.1835244415. The cubic root of 115051013 is about 486.3663078042.

The spelling of 115051013 in words is "one hundred fifteen million, fifty-one thousand, thirteen".

Divisors: 1 7 11 31 77 157 217 307 341 1099 1727 2149 2387 3377 4867 9517 12089 23639 34069 48199 53537 66619 104687 337393 374759 530189 732809 1494169 3711323 10459183 16435859 115051013