Base | Representation |
---|---|
bin | 1001100011100000001110… |
… | …01010011110110010100101 |
3 | 2202101122022200212112002001 |
4 | 10301300013022132302211 |
5 | 10223221213122400401 |
6 | 112404211032245301 |
7 | 4266000435641224 |
oct | 461600712366245 |
9 | 82348280775061 |
10 | 21011100200101 |
11 | 6770837339620 |
12 | 2434112b40831 |
13 | b9545218a7cb |
14 | 528d2a9b8cbb |
15 | 266830d80601 |
hex | 131c0729eca5 |
21011100200101 has 4 divisors (see below), whose sum is σ = 22921200218304. Its totient is φ = 19101000181900.
The previous prime is 21011100200087. The next prime is 21011100200143. The reversal of 21011100200101 is 10100200111012.
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 21011100200101 - 225 = 21011066645669 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 (21011100200191) 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, 955050009085 + ... + 955050009106.
It is an arithmetic number, because the mean of its divisors is an integer number (5730300054576).
Almost surely, 221011100200101 is an apocalyptic number.
It is an amenable number.
21011100200101 is a deficient number, since it is larger than the sum of its proper divisors (1910100018203).
21011100200101 is a wasteful number, since it uses less digits than its factorization.
21011100200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1910100018202.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21011100200101 its reverse (10100200111012), we get a palindrome (31111300311113).
The spelling of 21011100200101 in words is "twenty-one trillion, eleven billion, one hundred million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •