Search a number
-
+
5115500101 = 139269136811
BaseRepresentation
bin1001100001110100…
…00101011001000101
3111012111201022220201
410300322011121011
540434032000401
62203334530501
7240524014315
oct46072053105
914174638821
105115500101
112195625a38
12ba9206a31
13636a6b54a
14367569445
151ee16db01
hex130e85645

5115500101 has 8 divisors (see below), whose sum is σ = 5171493600. Its totient is φ = 5059781040.

The previous prime is 5115500099. The next prime is 5115500147. The reversal of 5115500101 is 1010055115.

It is a happy number.

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 5115500101 - 21 = 5115500099 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 25115500101 is an apocalyptic number.

It is an amenable number.

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

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

5115500101 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 137219.

The product of its (nonzero) digits is 125, while the sum is 19.

The square root of 5115500101 is about 71522.7243678539. The cubic root of 5115500101 is about 1723.0426697293.

Adding to 5115500101 its reverse (1010055115), we get a palindrome (6125555216).

The spelling of 5115500101 in words is "five billion, one hundred fifteen million, five hundred thousand, one hundred one".

Divisors: 1 139 269 37391 136811 19016729 36802159 5115500101