Base | Representation |
---|---|
bin | 1001100011100000000011… |
… | …10110100110001000100101 |
3 | 2202101122002111012211101112 |
4 | 10301300001312212020211 |
5 | 10223221022320214341 |
6 | 112404154130434405 |
7 | 4265665304420561 |
oct | 461600166461045 |
9 | 82348074184345 |
10 | 21011011101221 |
11 | 67707a1013289 |
12 | 24340a9132a05 |
13 | b95439892a8b |
14 | 528d1cc246a1 |
15 | 266828130aeb |
hex | 131c01da6225 |
21011011101221 has 2 divisors, whose sum is σ = 21011011101222. Its totient is φ = 21011011101220.
The previous prime is 21011011101161. The next prime is 21011011101251. The reversal of 21011011101221 is 12210111011012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21007097222500 + 3913878721 = 4583350^2 + 62561^2 .
It is a cyclic number.
It is not a de Polignac number, because 21011011101221 - 222 = 21011006906917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21011011101196 and 21011011101205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21011011101251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505505550610 + 10505505550611.
It is an arithmetic number, because the mean of its divisors is an integer number (10505505550611).
Almost surely, 221011011101221 is an apocalyptic number.
It is an amenable number.
21011011101221 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011011101221 is an equidigital number, since it uses as much as digits as its factorization.
21011011101221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21011011101221 its reverse (12210111011012), we get a palindrome (33221122112233).
The spelling of 21011011101221 in words is "twenty-one trillion, eleven billion, eleven million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •