Base | Representation |
---|---|
bin | 1001100110000111111000… |
… | …01111001111000001110101 |
3 | 2202201020122201110121002011 |
4 | 10303003330033033001311 |
5 | 10231210033432210401 |
6 | 112513414444444221 |
7 | 4305335130622006 |
oct | 463037417170165 |
9 | 82636581417064 |
10 | 21101111210101 |
11 | 67a5a2719a68a |
12 | 2449653549671 |
13 | ba0a98366280 |
14 | 52d4291411ad |
15 | 268d4d184451 |
hex | 1330fc3cf075 |
21101111210101 has 8 divisors (see below), whose sum is σ = 22724374179584. Its totient is φ = 19477862607600.
The previous prime is 21101111209991. The next prime is 21101111210111. The reversal of 21101111210101 is 10101211110112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21101111210101 - 29 = 21101111209589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101111210111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 438801 + ... + 6511126.
It is an arithmetic number, because the mean of its divisors is an integer number (2840546772448).
Almost surely, 221101111210101 is an apocalyptic number.
It is an amenable number.
21101111210101 is a deficient number, since it is larger than the sum of its proper divisors (1623262969483).
21101111210101 is a wasteful number, since it uses less digits than its factorization.
21101111210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7183491.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 21101111210101 its reverse (10101211110112), we get a palindrome (31202322320213).
The spelling of 21101111210101 in words is "twenty-one trillion, one hundred one billion, one hundred eleven million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •