Base | Representation |
---|---|
bin | 1001100011100000001111… |
… | …10100000110100101010001 |
3 | 2202101122100110101212000011 |
4 | 10301300013310012211101 |
5 | 10223221223421022433 |
6 | 112404212102154521 |
7 | 4266000630453343 |
oct | 461600764064521 |
9 | 82348313355004 |
10 | 21011111110993 |
11 | 6770842511093 |
12 | 2434116722a41 |
13 | b9545450ab63 |
14 | 528d2c219293 |
15 | 266831cd83cd |
hex | 131c07d06951 |
21011111110993 has 2 divisors, whose sum is σ = 21011111110994. Its totient is φ = 21011111110992.
The previous prime is 21011111110973. The next prime is 21011111111027. The reversal of 21011111110993 is 39901111111012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20477498392849 + 533612718144 = 4525207^2 + 730488^2 .
It is a cyclic number.
It is not a de Polignac number, because 21011111110993 - 217 = 21011110979921 is a prime.
It is a super-3 number, since 3×210111111109933 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (21011111110973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505555555496 + 10505555555497.
It is an arithmetic number, because the mean of its divisors is an integer number (10505555555497).
Almost surely, 221011111110993 is an apocalyptic number.
It is an amenable number.
21011111110993 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011111110993 is an equidigital number, since it uses as much as digits as its factorization.
21011111110993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 31.
The spelling of 21011111110993 in words is "twenty-one trillion, eleven billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •