Base | Representation |
---|---|
bin | 1001100110011000101001… |
… | …01111010111100000010001 |
3 | 2202202002220000110100001122 |
4 | 10303030110233113200101 |
5 | 10231332002212034301 |
6 | 112521503543412025 |
7 | 4306104155143613 |
oct | 463142457274021 |
9 | 82662800410048 |
10 | 21110112221201 |
11 | 67a9826011533 |
12 | 244b345a54015 |
13 | ba18a10ab843 |
14 | 52da4073adb3 |
15 | 2691c84b081b |
hex | 133314bd7811 |
21110112221201 has 2 divisors, whose sum is σ = 21110112221202. Its totient is φ = 21110112221200.
The previous prime is 21110112221161. The next prime is 21110112221213. The reversal of 21110112221201 is 10212221101112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20925126211201 + 184986010000 = 4574399^2 + 430100^2 .
It is a cyclic number.
It is not a de Polignac number, because 21110112221201 - 210 = 21110112220177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21110112221201.
It is not a weakly prime, because it can be changed into another prime (21110112221291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555056110600 + 10555056110601.
It is an arithmetic number, because the mean of its divisors is an integer number (10555056110601).
Almost surely, 221110112221201 is an apocalyptic number.
It is an amenable number.
21110112221201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21110112221201 is an equidigital number, since it uses as much as digits as its factorization.
21110112221201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21110112221201 its reverse (10212221101112), we get a palindrome (31322333322313).
The spelling of 21110112221201 in words is "twenty-one trillion, one hundred ten billion, one hundred twelve million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •