Search a number
-
+
5110601001 = 311376141177
BaseRepresentation
bin1001100001001110…
…11001010100101001
3111012011111102121120
410300213121110221
540431303213001
62203041525453
7240434251242
oct46047312451
914164442546
105110601001
11219288a1a0
12ba7643889
13635a4467c
14366a51cc9
151eda02236
hex1309d9529

5110601001 has 16 divisors (see below), whose sum is σ = 7435758528. Its totient is φ = 3096435200.

The previous prime is 5110600997. The next prime is 5110601003. The reversal of 5110601001 is 1001060115.

It is a cyclic number.

It is not a de Polignac number, because 5110601001 - 22 = 5110600997 is a prime.

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

It is a Curzon number.

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

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

Almost surely, 25110601001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 44952.

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

The square root of 5110601001 is about 71488.4676084192. The cubic root of 5110601001 is about 1722.4924430088.

Adding to 5110601001 its reverse (1001060115), we get a palindrome (6111661116).

The spelling of 5110601001 in words is "five billion, one hundred ten million, six hundred one thousand, one".

Divisors: 1 3 11 33 3761 11283 41177 41371 123531 124113 452947 1358841 154866697 464600091 1703533667 5110601001