Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …01110001111110100011001 |
3 | 2202210001222110101212112211 |
4 | 10303111233032033310121 |
5 | 10232013202332401332 |
6 | 112530254544435121 |
7 | 4306612513432315 |
oct | 463255716176431 |
9 | 82701873355484 |
10 | 21120220200217 |
11 | 68030427777a6 |
12 | 24512a7018aa1 |
13 | ba2822274508 |
14 | 53031cd6ab45 |
15 | 2695baa9c447 |
hex | 13356f38fd19 |
21120220200217 has 2 divisors, whose sum is σ = 21120220200218. Its totient is φ = 21120220200216.
The previous prime is 21120220200143. The next prime is 21120220200271. The reversal of 21120220200217 is 71200202202112.
Together with next prime (21120220200271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11996171675401 + 9124048524816 = 3463549^2 + 3020604^2 .
It is a cyclic number.
It is not a de Polignac number, because 21120220200217 - 27 = 21120220200089 is a prime.
It is not a weakly prime, because it can be changed into another prime (21120220200617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560110100108 + 10560110100109.
It is an arithmetic number, because the mean of its divisors is an integer number (10560110100109).
Almost surely, 221120220200217 is an apocalyptic number.
It is an amenable number.
21120220200217 is a deficient number, since it is larger than the sum of its proper divisors (1).
21120220200217 is an equidigital number, since it uses as much as digits as its factorization.
21120220200217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 21120220200217 its reverse (71200202202112), we get a palindrome (92320422402329).
The spelling of 21120220200217 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty million, two hundred thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •