Search a number
-
+
101101022009941 is a prime number
BaseRepresentation
bin10110111111001101101010…
…100000001101101001010101
3111020222011102001110210002111
4112333031222200031221111
5101222414343113304231
6555005100205311021
730203210400620512
oct2677155240155125
9436864361423074
10101101022009941
112a239780254388
12b40a07b865471
134454a29896615
141ad745bd16309
15ba4d09d4d4b1
hex5bf36a80da55

101101022009941 has 2 divisors, whose sum is σ = 101101022009942. Its totient is φ = 101101022009940.

The previous prime is 101101022009929. The next prime is 101101022010011. The reversal of 101101022009941 is 149900220101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 65991723413841 + 35109298596100 = 8123529^2 + 5925310^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101022009941 - 25 = 101101022009909 is a prime.

It is a super-3 number, since 3×1011010220099413 (a number of 43 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2101101022009941 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101101022009941 in words is "one hundred one trillion, one hundred one billion, twenty-two million, nine thousand, nine hundred forty-one".