Search a number
-
+
115100061 = 338366687
BaseRepresentation
bin1101101110001…
…00100110011101
322000120200121020
412313010212131
5213431200221
615230554353
72565222456
oct667044635
9260520536
10115100061
1159a7541a
12326689b9
131aacc85b
141140212d
15a188ac6
hex6dc499d

115100061 has 4 divisors (see below), whose sum is σ = 153466752. Its totient is φ = 76733372.

The previous prime is 115100059. The next prime is 115100071. The reversal of 115100061 is 160001511.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 115100061 - 21 = 115100059 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 115100061.

It is a congruent number.

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

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

Almost surely, 2115100061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 38366690.

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 115100061 is about 10728.4696485566. The cubic root of 115100061 is about 486.4354131077.

Adding to 115100061 its reverse (160001511), we get a palindrome (275101572).

The spelling of 115100061 in words is "one hundred fifteen million, one hundred thousand, sixty-one".

Divisors: 1 3 38366687 115100061