Search a number
-
+
5000011161 = 310121117817
BaseRepresentation
bin1001010100000011…
…00001110110011001
3110220110101212212120
410222001201312121
540220000324121
62144051331453
7234622252005
oct45201416631
913813355776
105000011161
112136415432
12b765b0b89
13618b639b2
143560a5705
151e3e59bc6
hex12a061d99

5000011161 has 16 divisors (see below), whose sum is σ = 6736739328. Its totient is φ = 3298352000.

The previous prime is 5000011157. The next prime is 5000011171. The reversal of 5000011161 is 1611100005.

It is a cyclic number.

It is not a de Polignac number, because 5000011161 - 22 = 5000011157 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 635725 + ... + 643541.

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

Almost surely, 25000011161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10032.

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

The square root of 5000011161 is about 70710.7570387986. The cubic root of 5000011161 is about 1709.9772190119.

Adding to 5000011161 its reverse (1611100005), we get a palindrome (6611111166).

The spelling of 5000011161 in words is "five billion, eleven thousand, one hundred sixty-one".

Divisors: 1 3 101 303 2111 6333 7817 23451 213211 639633 789517 2368551 16501687 49505061 1666670387 5000011161