Search a number
-
+
1100023111023 = 31093363985049
BaseRepresentation
bin10000000000011110011…
…111001001110101101111
310220011100111112221002120
4100000132133021311233
5121010321404023043
62201202120524023
7142321412111424
oct20003637116557
93804314487076
101100023111023
11394576406711
12159237620613
137c96880a735
143b3545a1d4b
151d932a18983
hex1001e7c9d6f

1100023111023 has 8 divisors (see below), whose sum is σ = 1480153422000. Its totient is φ = 726620770368.

The previous prime is 1100023110997. The next prime is 1100023111051. The reversal of 1100023111023 is 3201113200011.

It is a happy number.

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

It is not a de Polignac number, because 1100023111023 - 212 = 1100023106927 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1100023131023) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1681992198 + ... + 1681992851.

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

Almost surely, 21100023111023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3363985161.

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

Adding to 1100023111023 its reverse (3201113200011), we get a palindrome (4301136311034).

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

Divisors: 1 3 109 327 3363985049 10091955147 366674370341 1100023111023