Base | Representation |
---|---|
bin | 1001100110000111110111… |
… | …01100100001010111111001 |
3 | 2202201020122002100021100211 |
4 | 10303003323230201113321 |
5 | 10231210024120011301 |
6 | 112513413521431121 |
7 | 4305334660361461 |
oct | 463037354412771 |
9 | 82636562307324 |
10 | 21101102110201 |
11 | 67a5a22044803 |
12 | 244965049b4a1 |
13 | ba0a964cb309 |
14 | 52d427c52ba1 |
15 | 268d4c488051 |
hex | 1330fbb215f9 |
21101102110201 has 4 divisors (see below), whose sum is σ = 21102066930304. Its totient is φ = 21100137290100.
The previous prime is 21101102110159. The next prime is 21101102110303. The reversal of 21101102110201 is 10201120110112.
It is a happy number.
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 21101102110201 - 219 = 21101101585913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21101102114201) 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, 482377245 + ... + 482420986.
It is an arithmetic number, because the mean of its divisors is an integer number (5275516732576).
Almost surely, 221101102110201 is an apocalyptic number.
It is an amenable number.
21101102110201 is a deficient number, since it is larger than the sum of its proper divisors (964820103).
21101102110201 is an equidigital number, since it uses as much as digits as its factorization.
21101102110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 964820102.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21101102110201 its reverse (10201120110112), we get a palindrome (31302222220313).
The spelling of 21101102110201 in words is "twenty-one trillion, one hundred one billion, one hundred two million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •