Search a number
-
+
5151013113 = 35941117079
BaseRepresentation
bin1001100110000011…
…00011100011111001
3111021222112120121110
410303001203203321
541022124404423
62211044030533
7241434613641
oct46301434371
914258476543
105151013113
112203681434
12bb9092449
1364122396c
1436c171521
15202336193
hex1330638f9

5151013113 has 16 divisors (see below), whose sum is σ = 6987110400. Its totient is φ = 3374507280.

The previous prime is 5151013111. The next prime is 5151013163. The reversal of 5151013113 is 3113101515.

It is not a de Polignac number, because 5151013113 - 21 = 5151013111 is a prime.

It is a Curzon number.

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

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

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

Almost surely, 25151013113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11252.

The product of its (nonzero) digits is 225, while the sum is 21.

The square root of 5151013113 is about 71770.5588176656. The cubic root of 5151013113 is about 1727.0207349504.

Adding to 5151013113 its reverse (3113101515), we get a palindrome (8264114628).

The spelling of 5151013113 in words is "five billion, one hundred fifty-one million, thirteen thousand, one hundred thirteen".

Divisors: 1 3 59 177 4111 7079 12333 21237 242549 417661 727647 1252983 29101769 87305307 1717004371 5151013113