Search a number
-
+
12201102110 = 251220110211
BaseRepresentation
bin10110101110011111…
…00000101100011110
31011111022112012120202
423113033200230132
5144441440231420
65334411543502
7611232441161
oct132717405436
934438465522
1012201102110
1151a122766a
12244615ab92
1311c5a16662
1483a609ad8
154b6246575
hex2d73e0b1e

12201102110 has 8 divisors (see below), whose sum is σ = 21961983816. Its totient is φ = 4880440840.

The previous prime is 12201102103. The next prime is 12201102131. The reversal of 12201102110 is 1120110221.

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

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

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 3 ways as a sum of consecutive naturals, for example, 610055096 + ... + 610055115.

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

Almost surely, 212201102110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1220110218.

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

Adding to 12201102110 its reverse (1120110221), we get a palindrome (13321212331).

The spelling of 12201102110 in words is "twelve billion, two hundred one million, one hundred two thousand, one hundred ten".

Divisors: 1 2 5 10 1220110211 2440220422 6100551055 12201102110