Search a number
-
+
1102001200033 is a prime number
BaseRepresentation
bin10000000010010100011…
…000111101101110100001
310220100110100200021002111
4100002110120331232201
5121023344301400113
62202130302115321
7142421421434656
oct20022430755641
93810410607074
101102001200033
113953a0a48218
121596a9b7bb41
137cbc25828c6
143b4a1195c2d
151d9eb4ee13d
hex1009463dba1

1102001200033 has 2 divisors, whose sum is σ = 1102001200034. Its totient is φ = 1102001200032.

The previous prime is 1102001199979. The next prime is 1102001200039. The reversal of 1102001200033 is 3300021002011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 680050921104 + 421950278929 = 824652^2 + 649577^2 .

It is a cyclic number.

It is not a de Polignac number, because 1102001200033 - 237 = 964562246561 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1102001199986 and 1102001200022.

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

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

Almost surely, 21102001200033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 13.

Adding to 1102001200033 its reverse (3300021002011), we get a palindrome (4402022202044).

The spelling of 1102001200033 in words is "one trillion, one hundred two billion, one million, two hundred thousand, thirty-three".