Search a number
-
+
5104051161 = 311233474201
BaseRepresentation
bin1001100000011100…
…11010001111011001
3111011201011122220220
410300032122033121
540423114114121
62202245310253
7240324501426
oct46016321731
914151148826
105104051161
11218a116200
12ba5405389
13634590321
14365c28d4d
151ed15b6c6
hex13039a3d9

5104051161 has 24 divisors (see below), whose sum is σ = 7484333472. Its totient is φ = 3091704000.

The previous prime is 5104051159. The next prime is 5104051181. The reversal of 5104051161 is 1611504015.

It is not a de Polignac number, because 5104051161 - 21 = 5104051159 is a prime.

It is a Curzon number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1212861 + ... + 1217061.

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

Almost surely, 25104051161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 600, while the sum is 24.

The square root of 5104051161 is about 71442.6424553292. The cubic root of 5104051161 is about 1721.7562691162.

Adding to 5104051161 its reverse (1611504015), we get a palindrome (6715555176).

It can be divided in two parts, 510405 and 1161, that added together give a triangular number (511566 = T1011).

The spelling of 5104051161 in words is "five billion, one hundred four million, fifty-one thousand, one hundred sixty-one".

Divisors: 1 3 11 33 121 363 3347 4201 10041 12603 36817 46211 110451 138633 404987 508321 1214961 1524963 14060747 42182241 154668217 464004651 1701350387 5104051161