Search a number
-
+
9901101011141 is a prime number
BaseRepresentation
bin1001000000010100011110…
…0110111101000011000101
31022001112110202100001221002
42100011013212331003011
52244204423324324031
633020300352303045
72041221340662644
oct220050746750305
938045422301832
109901101011141
11317804044398a
12113aa96841a85
1356a892791a82
142633043d135b
1512283c6ddccb
hex901479bd0c5

9901101011141 has 2 divisors, whose sum is σ = 9901101011142. Its totient is φ = 9901101011140.

The previous prime is 9901101011093. The next prime is 9901101011167. The reversal of 9901101011141 is 1411101011099.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8863249448641 + 1037851562500 = 2977121^2 + 1018750^2 .

It is a cyclic number.

It is not a de Polignac number, because 9901101011141 - 222 = 9901096816837 is a prime.

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

It is a congruent number.

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

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

Almost surely, 29901101011141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 9901101011141 in words is "nine trillion, nine hundred one billion, one hundred one million, eleven thousand, one hundred forty-one".