Search a number
-
+
5051014001 = 1147193223227
BaseRepresentation
bin1001011010001000…
…00101101101110001
3111001000101002121122
410231010011231301
540321024422001
62153112432025
7236111624225
oct45504055561
914030332548
105051014001
112162190640
12b8b6a8615
136265b06a7
1435cb80785
151e8681b1b
hex12d105b71

5051014001 has 32 divisors (see below), whose sum is σ = 5706989568. Its totient is φ = 4431191040.

The previous prime is 5051013997. The next prime is 5051014019. The reversal of 5051014001 is 1004101505.

It is a cyclic number.

It is not a de Polignac number, because 5051014001 - 22 = 5051013997 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22251050 + ... + 22251276.

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

Almost surely, 25051014001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 701.

The product of its (nonzero) digits is 100, while the sum is 17.

The square root of 5051014001 is about 71070.4861457975. The cubic root of 5051014001 is about 1715.7717941603.

Adding to 5051014001 its reverse (1004101505), we get a palindrome (6055115506).

The spelling of 5051014001 in words is "five billion, fifty-one million, fourteen thousand, one".

Divisors: 1 11 47 193 223 227 517 2123 2453 2497 9071 10481 10669 43039 43811 50621 99781 115291 117359 473429 481921 556831 2022833 2059117 2379187 9769853 22251163 22650287 26171057 107468383 459183091 5051014001