Search a number
BaseRepresentation
bin10111111110010…
…00111100101110
3112000101222211222
423333020330232
5402440213402
631542143342
74661221406
oct1377107456
9460358758
10201101102
11a3575264
1257421b52
1332881547
141c9cb806
15129c57a2
hexbfc8f2e

201101102 has 8 divisors (see below), whose sum is σ = 301716336. Its totient is φ = 100528992.

The previous prime is 201101093. The next prime is 201101137.

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

201101102 is nontrivially palindromic in base 10.

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

It is a super-2 number, since 2×2011011022 = 80883306451228808, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6278 + ... + 21014.

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

Almost surely, 2201101102 is an apocalyptic number.

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

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

201101102 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 21562.

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

The square root of 201101102 is about 14181.0120231244. The cubic root of 201101102 is about 585.8747980411.

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