Base | Representation |
---|---|
bin | 1001100011110000110100… |
… | …10110101100001001000101 |
3 | 2202102111022210012001111122 |
4 | 10301320122112230021011 |
5 | 10223342441044232323 |
6 | 112412243225243325 |
7 | 4266434331601145 |
oct | 461703226541105 |
9 | 82374283161448 |
10 | 21020012102213 |
11 | 677459a928583 |
12 | 243599b633545 |
13 | b96242603877 |
14 | 52953441a925 |
15 | 266ba3458ec8 |
hex | 131e1a5ac245 |
21020012102213 has 8 divisors (see below), whose sum is σ = 21698143706880. Its totient is φ = 20341884666240.
The previous prime is 21020012102087. The next prime is 21020012102239. The reversal of 21020012102213 is 31220121002012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21020012102213 - 212 = 21020012098117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020012102191 and 21020012102200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020012108213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11664533 + ... + 13345461.
It is an arithmetic number, because the mean of its divisors is an integer number (2712267963360).
Almost surely, 221020012102213 is an apocalyptic number.
It is an amenable number.
21020012102213 is a deficient number, since it is larger than the sum of its proper divisors (678131604667).
21020012102213 is a wasteful number, since it uses less digits than its factorization.
21020012102213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2084347.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21020012102213 its reverse (31220121002012), we get a palindrome (52240133104225).
The spelling of 21020012102213 in words is "twenty-one trillion, twenty billion, twelve million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •