Search a number
-
+
115104051 = 334263113
BaseRepresentation
bin1101101110001…
…01100100110011
322000120220002000
412313011210303
5213431312201
615231025043
72565240216
oct667054463
9260526060
10115104051
1159a78417
123266b183
131ab0160a
141140377d
15a189d86
hex6dc5933

115104051 has 8 divisors (see below), whose sum is σ = 170524560. Its totient is φ = 76736016.

The previous prime is 115104047. The next prime is 115104053. The reversal of 115104051 is 150401511.

It is a happy number.

It is not a de Polignac number, because 115104051 - 22 = 115104047 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (115104053) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2131530 + ... + 2131583.

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

Almost surely, 2115104051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4263122 (or 4263116 counting only the distinct ones).

The product of its (nonzero) digits is 100, while the sum is 18.

The square root of 115104051 is about 10728.6556007731. The cubic root of 115104051 is about 486.4410338834.

Adding to 115104051 its reverse (150401511), we get a palindrome (265505562).

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

Divisors: 1 3 9 27 4263113 12789339 38368017 115104051