Search a number
-
+
1101323313229 is a prime number
BaseRepresentation
bin10000000001101011111…
…111000010000001001101
310220021201010010001012211
4100001223333002001031
5121021002232010404
62201535124430421
7142365550463416
oct20015377020115
93807633101184
101101323313229
11395083331897
1215953ab48411
137cb14cb6759
143b43913680d
151d9abc48b04
hex1006bfc204d

1101323313229 has 2 divisors, whose sum is σ = 1101323313230. Its totient is φ = 1101323313228.

The previous prime is 1101323313191. The next prime is 1101323313257. The reversal of 1101323313229 is 9223133231011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 907284825225 + 194038488004 = 952515^2 + 440498^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101323313229 - 29 = 1101323312717 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21101323313229 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1101323313229 in words is "one trillion, one hundred one billion, three hundred twenty-three million, three hundred thirteen thousand, two hundred twenty-nine".