Search a number
-
+
10116590371 = 62617161563
BaseRepresentation
bin10010110101111111…
…01110101100100011
3222010001011001001021
421122333232230203
5131204321342441
64351505350311
7505461412366
oct113277565443
928101131037
1010116590371
114321608098
121b64038397
13c52bbc464
146bd8320dd
153e323d3d1
hex25afeeb23

10116590371 has 4 divisors (see below), whose sum is σ = 10116814552. Its totient is φ = 10116366192.

The previous prime is 10116590359. The next prime is 10116590383. The reversal of 10116590371 is 17309561101.

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

It is an interprime number because it is at equal distance from previous prime (10116590359) and next prime (10116590383).

It is a cyclic number.

It is not a de Polignac number, because 10116590371 - 27 = 10116590243 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210116590371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 224180.

The product of its (nonzero) digits is 5670, while the sum is 34.

The spelling of 10116590371 in words is "ten billion, one hundred sixteen million, five hundred ninety thousand, three hundred seventy-one".

Divisors: 1 62617 161563 10116590371