Base | Representation |
---|---|
bin | 1001100011010001101110… |
… | …11011011010100111001101 |
3 | 2202100220020111001222100001 |
4 | 10301220313123122213031 |
5 | 10223104244410324323 |
6 | 112400443024004301 |
7 | 4265303564266621 |
oct | 461506733324715 |
9 | 82326214058301 |
10 | 21003320011213 |
11 | 6768504655551 |
12 | 2432701460691 |
13 | b947b234a147 |
14 | 5287cd5ad181 |
15 | 266527d043ad |
hex | 131a376da9cd |
21003320011213 has 16 divisors (see below), whose sum is σ = 22132427817600. Its totient is φ = 19876585291200.
The previous prime is 21003320011199. The next prime is 21003320011217. The reversal of 21003320011213 is 31211002330012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21003320011213 is a prime.
It is a super-2 number, since 2×210033200112132 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21003320011217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129526695 + ... + 129688747.
It is an arithmetic number, because the mean of its divisors is an integer number (1383276738600).
Almost surely, 221003320011213 is an apocalyptic number.
It is an amenable number.
21003320011213 is a deficient number, since it is larger than the sum of its proper divisors (1129107806387).
21003320011213 is a wasteful number, since it uses less digits than its factorization.
21003320011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169332.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 21003320011213 its reverse (31211002330012), we get a palindrome (52214322341225).
The spelling of 21003320011213 in words is "twenty-one trillion, three billion, three hundred twenty million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •