Search a number
-
+
141011101397 is a prime number
BaseRepresentation
bin1000001101010011101…
…0101010011011010101
3111110222022021011010002
42003110322222123111
54302242320221042
6144440221141045
713121246404535
oct2032472523325
9443868234102
10141011101397
11548910aa631
12233b43ba785
13103b31b814a
146b79a294c5
153a04897132
hex20d4eaa6d5

141011101397 has 2 divisors, whose sum is σ = 141011101398. Its totient is φ = 141011101396.

The previous prime is 141011101393. The next prime is 141011101477. The reversal of 141011101397 is 793101110141.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 141004756036 + 6345361 = 375506^2 + 2519^2 .

It is a cyclic number.

It is not a de Polignac number, because 141011101397 - 22 = 141011101393 is a prime.

It is a congruent number.

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

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

Almost surely, 2141011101397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 141011101397 in words is "one hundred forty-one billion, eleven million, one hundred one thousand, three hundred ninety-seven".