Base | Representation |
---|---|
bin | 1001100011001101011010… |
… | …10001101111100111110101 |
3 | 2202100200020221201222112211 |
4 | 10301212231101233213311 |
5 | 10223040023032020041 |
6 | 112355421025413421 |
7 | 4265162261346115 |
oct | 461465521574765 |
9 | 82320227658484 |
10 | 21001002220021 |
11 | 676752529273a |
12 | 243217519a271 |
13 | b945030b6075 |
14 | 52864d82d045 |
15 | 26643e5bb481 |
hex | 1319ad46f9f5 |
21001002220021 has 2 divisors, whose sum is σ = 21001002220022. Its totient is φ = 21001002220020.
The previous prime is 21001002219997. The next prime is 21001002220049. The reversal of 21001002220021 is 12002220010012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16935076800625 + 4065925419396 = 4115225^2 + 2016414^2 .
It is a cyclic number.
It is not a de Polignac number, because 21001002220021 - 211 = 21001002217973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21001002219983 and 21001002220010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21001002220091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500501110010 + 10500501110011.
It is an arithmetic number, because the mean of its divisors is an integer number (10500501110011).
Almost surely, 221001002220021 is an apocalyptic number.
It is an amenable number.
21001002220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
21001002220021 is an equidigital number, since it uses as much as digits as its factorization.
21001002220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21001002220021 its reverse (12002220010012), we get a palindrome (33003222230033).
The spelling of 21001002220021 in words is "twenty-one trillion, one billion, two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •