Search a number
-
+
10140555661 is a prime number
BaseRepresentation
bin10010111000110110…
…01001100110001101
3222011201020121020121
421130123021212031
5131231440240121
64354123144541
7506202205135
oct113433114615
928151217217
1010140555661
114334096615
121b70075151
13c57b606c2
146c2aadac5
153e53c4141
hex25c6c998d

10140555661 has 2 divisors, whose sum is σ = 10140555662. Its totient is φ = 10140555660.

The previous prime is 10140555643. The next prime is 10140555673. The reversal of 10140555661 is 16655504101.

10140555661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9512100900 + 628454761 = 97530^2 + 25069^2 .

It is a cyclic number.

It is not a de Polignac number, because 10140555661 - 219 = 10140031373 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210140555661 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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