Cookie Consent by FreePrivacyPolicy.com
Search a number
BaseRepresentation
bin10000000000011101000…
…110111111110001001110
310220011021220001211020120
4100000131012333301032
5121010300000013402
62201155533325410
7142321011510522
oct20003506776116
93804256054216
101100000001102
11394564361902
1215922b936866
137c963aa8922
143b3514a7d82
151d9309a13bc
hex1001d1bfc4e

1100000001102 has 16 divisors (see below), whose sum is σ = 2230985918592. Its totient is φ = 361502347640.

The previous prime is 1100000001097. The next prime is 1100000001127. The reversal of 1100000001102 is 2011000000011.

It is a Harshad number since it is a multiple of its sum of digits (6).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21100000001102 is an apocalyptic number.

1100000001102 is an abundant number, since it is smaller than the sum of its proper divisors (1130985917490).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 2582159703.

The product of its (nonzero) digits is 2, while the sum is 6.

Adding to 1100000001102 its reverse (2011000000011), we get a palindrome (3111000001113).

The spelling of 1100000001102 in words is "one trillion, one hundred billion, one thousand, one hundred two".