Search a number
-
+
10140110291 is a prime number
BaseRepresentation
bin10010111000110010…
…11100110111010011
3222011200101222022102
421130121130313103
5131231332012131
64354105431015
7506165341523
oct113431346723
928150358272
1010140110291
114333911a43
121b6ba9b46b
13c57a35a7c
146c29d5683
153e53371cb
hex25c65cdd3

10140110291 has 2 divisors, whose sum is σ = 10140110292. Its totient is φ = 10140110290.

The previous prime is 10140110237. The next prime is 10140110293. The reversal of 10140110291 is 19201104101.

It is a strong prime.

It is an emirp because it is prime and its reverse (19201104101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10140110291 - 210 = 10140109267 is a prime.

It is a super-4 number, since 4×101401102914 (a number of 41 digits) contains 4444 as substring.

Together with 10140110293, it forms a pair of twin primes.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (10140110293) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070055145 + 5070055146.

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

Almost surely, 210140110291 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 20.

Adding to 10140110291 its reverse (19201104101), we get a palindrome (29341214392).

The spelling of 10140110291 in words is "ten billion, one hundred forty million, one hundred ten thousand, two hundred ninety-one".