Search a number
-
+
1102020321323 is a prime number
BaseRepresentation
bin10000000010010101100…
…001111010000000101011
310220100111200122201120102
4100002111201322000223
5121023414200240243
62202132224020015
7142422043114115
oct20022541720053
93810450581512
101102020321323
11395400818339
121596b446160b
137cbc651908c
143b4a39323b5
151d9ed0299b8
hex1009587a02b

1102020321323 has 2 divisors, whose sum is σ = 1102020321324. Its totient is φ = 1102020321322.

The previous prime is 1102020321301. The next prime is 1102020321331. The reversal of 1102020321323 is 3231230202011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1102020321323 - 28 = 1102020321067 is a prime.

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 21102020321323 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 20.

Adding to 1102020321323 its reverse (3231230202011), we get a palindrome (4333250523334).

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