Search a number
201100001102 = 271113117185781
BaseRepresentation
bin1011101101001001111…
…1100111111101001110
3201020002000010112022222
42323102133213331032
511243323100013402
6232214542535342
720346305543210
oct2732237477516
9636060115288
10201100001102
1178316787320
1232b83b97552
1315c6b1a04c0
149a3a2205b0
15536ed0a7a2
hex2ed27e7f4e

201100001102 has 64 divisors (see below), whose sum is σ = 405363184128. Its totient is φ = 72261072000.

The previous prime is 201100001101. The next prime is 201100001111.

It can be divided in two parts, 20110000 and 1102, that added together give a palindrome (20111102).

201100001102 is nontrivially palindromic in base 10.

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2301452 + ... + 2387232.

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

Almost surely, 2201100001102 is an apocalyptic number.

201100001102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.

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

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

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

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

The sum of its prime factors is 86985.

The product of its (nonzero) digits is 4, while the sum is 8.

The spelling of 201100001102 in words is "two hundred one billion, one hundred million, one thousand, one hundred two".