Search a number
-
+
10160500051 = 13781576927
BaseRepresentation
bin10010111011001110…
…01110110101010011
3222020002202212210201
421131213032311103
5131302042000201
64400114440031
7506533553062
oct113547166523
928202685721
1010160500051
114344379089
121b76893017
13c5c024710
146c55c21d9
153e7013801
hex25d9ced53

10160500051 has 4 divisors (see below), whose sum is σ = 10942076992. Its totient is φ = 9378923112.

The previous prime is 10160500043. The next prime is 10160500081. The reversal of 10160500051 is 15000506101.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 10160500051 - 23 = 10160500043 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 390788451 + ... + 390788476.

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

Almost surely, 210160500051 is an apocalyptic number.

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

10160500051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 781576940.

The product of its (nonzero) digits is 150, while the sum is 19.

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

Divisors: 1 13 781576927 10160500051