Search a number
-
+
10611051011129 is a prime number
BaseRepresentation
bin1001101001101001001111…
…1011010001110000111001
31101120101222101111211200002
42122122103323101300321
52342322413024324004
634322352144522345
72143423510263542
oct232322373216071
941511871454602
1010611051011129
113421137736868
1212345ab6203b5
135bc805460a6a
14289812d614c9
1513604007961e
hex9a693ed1c39

10611051011129 has 2 divisors, whose sum is σ = 10611051011130. Its totient is φ = 10611051011128.

The previous prime is 10611051011089. The next prime is 10611051011159. The reversal of 10611051011129 is 92111015011601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10535555205904 + 75495805225 = 3245852^2 + 274765^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10611051011129 is a prime.

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

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

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

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

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

Almost surely, 210611051011129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 29.

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