Search a number
-
+
21100211101 = 31680651971
BaseRepresentation
bin10011101001101010…
…111010101110011101
32000110111202210011001
4103221222322232131
5321203123223401
613405430430301
71344611556304
oct235152725635
960414683131
1021100211101
118a485789a2
12410a502391
131cb3600718
14104247b43b
15837644601
hex4e9abab9d

21100211101 has 4 divisors (see below), whose sum is σ = 21780863104. Its totient is φ = 20419559100.

The previous prime is 21100211089. The next prime is 21100211107. The reversal of 21100211101 is 10111200112.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 21100211101 - 29 = 21100210589 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 221100211101 is an apocalyptic number.

It is an amenable number.

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

21100211101 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 680652002.

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

Adding to 21100211101 its reverse (10111200112), we get a palindrome (31211411213).

The spelling of 21100211101 in words is "twenty-one billion, one hundred million, two hundred eleven thousand, one hundred one".

Divisors: 1 31 680651971 21100211101