Base | Representation |
---|---|
bin | 10011101001101110… |
… | …010110101010101101 |
3 | 2000110120110112220222 |
4 | 103221232112222231 |
5 | 321203341040411 |
6 | 13405502021125 |
7 | 1344622330625 |
oct | 235156265255 |
9 | 60416415828 |
10 | 21101111981 |
11 | 8a49033824 |
12 | 410a8777a5 |
13 | 1cb38577a1 |
14 | 1042633885 |
15 | 8377714db |
hex | 4e9b96aad |
21101111981 has 2 divisors, whose sum is σ = 21101111982. Its totient is φ = 21101111980.
The previous prime is 21101111893. The next prime is 21101112007. The reversal of 21101111981 is 18911110112.
It is an a-pointer prime, because the next prime (21101112007) can be obtained adding 21101111981 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18449788900 + 2651323081 = 135830^2 + 51491^2 .
It is a cyclic number.
It is not a de Polignac number, because 21101111981 - 230 = 20027370157 is a prime.
It is a super-2 number, since 2×211011119812 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21101111981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21101111081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550555990 + 10550555991.
It is an arithmetic number, because the mean of its divisors is an integer number (10550555991).
Almost surely, 221101111981 is an apocalyptic number.
It is an amenable number.
21101111981 is a deficient number, since it is larger than the sum of its proper divisors (1).
21101111981 is an equidigital number, since it uses as much as digits as its factorization.
21101111981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 26.
The spelling of 21101111981 in words is "twenty-one billion, one hundred one million, one hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •