Base | Representation |
---|---|
bin | 1001100011010001101110… |
… | …11111100111100110110011 |
3 | 2202100220020120010221201101 |
4 | 10301220313133213212303 |
5 | 10223104300201104021 |
6 | 112400443103345231 |
7 | 4265303606536066 |
oct | 461506737474663 |
9 | 82326216127641 |
10 | 21003321113011 |
11 | 6768505238326 |
12 | 24327018b2217 |
13 | b947b26447b3 |
14 | 5287cd7b88dd |
15 | 266527e70a91 |
hex | 131a377e79b3 |
21003321113011 has 2 divisors, whose sum is σ = 21003321113012. Its totient is φ = 21003321113010.
The previous prime is 21003321113009. The next prime is 21003321113083. The reversal of 21003321113011 is 11031112330012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21003321113011 - 21 = 21003321113009 is a prime.
It is a super-2 number, since 2×210033211130112 (a number of 27 digits) contains 22 as substring.
Together with 21003321113009, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 21003321113011.
It is not a weakly prime, because it can be changed into another prime (21003321110011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10501660556505 + 10501660556506.
It is an arithmetic number, because the mean of its divisors is an integer number (10501660556506).
Almost surely, 221003321113011 is an apocalyptic number.
21003321113011 is a deficient number, since it is larger than the sum of its proper divisors (1).
21003321113011 is an equidigital number, since it uses as much as digits as its factorization.
21003321113011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 21003321113011 its reverse (11031112330012), we get a palindrome (32034433443023).
The spelling of 21003321113011 in words is "twenty-one trillion, three billion, three hundred twenty-one million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •