Search a number
-
+
10661050129 is a prime number
BaseRepresentation
bin10011110110111001…
…01011011100010001
31000111222122110102111
421323130223130101
5133313212101004
64521515145321
7525122300542
oct117334533421
930458573374
1010661050129
114580980834
122096445241
13100b93ccb2
14731c7c4c9
15425e39a04
hex27b72b711

10661050129 has 2 divisors, whose sum is σ = 10661050130. Its totient is φ = 10661050128.

The previous prime is 10661050111. The next prime is 10661050139. The reversal of 10661050129 is 92105016601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9969623104 + 691427025 = 99848^2 + 26295^2 .

It is a cyclic number.

It is not a de Polignac number, because 10661050129 - 25 = 10661050097 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (10661050139) 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, 5330525064 + 5330525065.

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

Almost surely, 210661050129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 31.

The spelling of 10661050129 in words is "ten billion, six hundred sixty-one million, fifty thousand, one hundred twenty-nine".