Base | Representation |
---|---|
bin | 1001101001100111001110… |
… | …10111000000101000001001 |
3 | 2210010201011101000210221202 |
4 | 10310303213113000220021 |
5 | 10240141122110323032 |
6 | 113044445122313545 |
7 | 4320111441615611 |
oct | 464634727005011 |
9 | 83121141023852 |
10 | 21221020011017 |
11 | 6841869624562 |
12 | 24689387b88b5 |
13 | bac19769b988 |
14 | 535162307a41 |
15 | 26c01a122d62 |
hex | 134ce75c0a09 |
21221020011017 has 2 divisors, whose sum is σ = 21221020011018. Its totient is φ = 21221020011016.
The previous prime is 21221020011013. The next prime is 21221020011029. The reversal of 21221020011017 is 71011002012212.
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., 16957026287881 + 4263993723136 = 4117891^2 + 2064944^2 .
It is a cyclic number.
It is not a de Polignac number, because 21221020011017 - 22 = 21221020011013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21221020011017.
It is not a weakly prime, because it can be changed into another prime (21221020011013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610510005508 + 10610510005509.
It is an arithmetic number, because the mean of its divisors is an integer number (10610510005509).
Almost surely, 221221020011017 is an apocalyptic number.
It is an amenable number.
21221020011017 is a deficient number, since it is larger than the sum of its proper divisors (1).
21221020011017 is an equidigital number, since it uses as much as digits as its factorization.
21221020011017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 21221020011017 its reverse (71011002012212), we get a palindrome (92232022023229).
The spelling of 21221020011017 in words is "twenty-one trillion, two hundred twenty-one billion, twenty million, eleven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •