Base | Representation |
---|---|
bin | 1001100011010001001100… |
… | …01101101100000111010101 |
3 | 2202100212111100121212010100 |
4 | 10301220212031230013111 |
5 | 10223103201441401323 |
6 | 112400354225444313 |
7 | 4265263456401216 |
oct | 461504615540725 |
9 | 82325440555110 |
10 | 21003031200213 |
11 | 6768376623577 |
12 | 24326407a0699 |
13 | b9476756916a |
14 | 5287a30ad40d |
15 | 26650c7a5943 |
hex | 131a2636c1d5 |
21003031200213 has 6 divisors (see below), whose sum is σ = 30337711733654. Its totient is φ = 14002020800136.
The previous prime is 21003031200169. The next prime is 21003031200227. The reversal of 21003031200213 is 31200213030012.
It can be written as a sum of positive squares in only one way, i.e., 15519762677169 + 5483268523044 = 3939513^2 + 2341638^2 .
It is not a de Polignac number, because 21003031200213 - 29 = 21003031199701 is a prime.
It is a super-2 number, since 2×210030312002132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21003031200253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1166835066670 + ... + 1166835066687.
Almost surely, 221003031200213 is an apocalyptic number.
It is an amenable number.
21003031200213 is a deficient number, since it is larger than the sum of its proper divisors (9334680533441).
21003031200213 is a wasteful number, since it uses less digits than its factorization.
21003031200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2333670133363 (or 2333670133360 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 21003031200213 its reverse (31200213030012), we get a palindrome (52203244230225).
The spelling of 21003031200213 in words is "twenty-one trillion, three billion, thirty-one million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •