Search a number
-
+
1101200329969 is a prime number
BaseRepresentation
bin10000000001100100101…
…001111000110011110001
310220021101112200211220021
4100001210221320303301
5121020224241024334
62201515012443441
7142362525235555
oct20014451706361
93807345624807
101101200329969
1139501a972733
12159505919581
137cac56869ac
143b426a81865
151d9a10543b4
hex10064a78cf1

1101200329969 has 2 divisors, whose sum is σ = 1101200329970. Its totient is φ = 1101200329968.

The previous prime is 1101200329961. The next prime is 1101200330053. The reversal of 1101200329969 is 9699230021011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1101003208369 + 197121600 = 1049287^2 + 14040^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101200329969 - 23 = 1101200329961 is a prime.

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

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

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

Almost surely, 21101200329969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52488, while the sum is 43.

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