Search a number
-
+
115016133 = 3227168893
BaseRepresentation
bin1101101101100…
…00000111000101
322000102102110210
412312300013011
5213421004013
615225110033
72564423001
oct666600705
9260372423
10115016133
1159a18361
1232628319
131aaa05ab
14113bd701
15a16dcc3
hex6db01c5

115016133 has 8 divisors (see below), whose sum is σ = 154031328. Its totient is φ = 76339184.

The previous prime is 115016131. The next prime is 115016141. The reversal of 115016133 is 331610511.

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

It is a cyclic number.

It is not a de Polignac number, because 115016133 - 21 = 115016131 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2115016133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 169123.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 115016133 is about 10724.5574733879. The cubic root of 115016133 is about 486.3171523005.

Adding to 115016133 its reverse (331610511), we get a palindrome (446626644).

The spelling of 115016133 in words is "one hundred fifteen million, sixteen thousand, one hundred thirty-three".

Divisors: 1 3 227 681 168893 506679 38338711 115016133