Search a number
-
+
5110013201135 = 51225183421977
BaseRepresentation
bin100101001011100010010…
…0001011000101011101111
3200002111211121100210100012
41022113010201120223233
51132210301334414020
614511301353123435
71035120614353643
oct112270441305357
920074747323305
105110013201135
1116a01652638a7
126a64310b957b
132b0b45233a9b
1413947c604c23
158cdcaa757c5
hex4a5c4858aef

5110013201135 has 8 divisors (see below), whose sum is σ = 6132516446736. Its totient is φ = 4087676824000.

The previous prime is 5110013201131. The next prime is 5110013201149. The reversal of 5110013201135 is 5311023100115.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 5110013201135 - 22 = 5110013201131 is a prime.

It is a super-2 number, since 2×51100132011352 (a number of 26 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41649734 + ... + 41772243.

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

Almost surely, 25110013201135 is an apocalyptic number.

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

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

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

The sum of its prime factors is 83434233.

The product of its (nonzero) digits is 450, while the sum is 23.

The spelling of 5110013201135 in words is "five trillion, one hundred ten billion, thirteen million, two hundred one thousand, one hundred thirty-five".

Divisors: 1 5 12251 61255 83421977 417109885 1022002640227 5110013201135