Search a number
BaseRepresentation
bin10000000000101001000…
…110111001110100011011
310220011210220212000222101
4100000221012321310123
5121011203013201243
62201231524104231
7142326004530463
oct20005106716433
93804726760871
101100201303323
11394657a54181
12159287235077
137c9966ca875
143b370108ba3
151d9434b654d
hex100291b9d1b

1100201303323 has 8 divisors (see below), whose sum is σ = 1101623171040. Its totient is φ = 1098779700480.

The previous prime is 1100201303309. The next prime is 1100201303339. The reversal of 1100201303323 is 3233031020011.

Adding to 1100201303323 its reverse (3233031020011), we get a palindrome (4333232323334).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1100201303323 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (1100201303423) 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 in 7 ways as a sum of consecutive naturals, for example, 9052011 + ... + 9172747.

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

Almost surely, 21100201303323 is an apocalyptic number.

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

1100201303323 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 132437.

The product of its (nonzero) digits is 324, while the sum is 19.

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