Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …10110100111000111001001 |
3 | 2202202022000200222202112111 |
4 | 10303032023112213013021 |
5 | 10231400041132021413 |
6 | 112522433232142321 |
7 | 4306204400643223 |
oct | 463161326470711 |
9 | 82668020882474 |
10 | 21112102220233 |
11 | 67aa657348232 |
12 | 244b8003979a1 |
13 | ba1b2a463a6b |
14 | 52db8cb51413 |
15 | 269293049d3d |
hex | 13338b5a71c9 |
21112102220233 has 2 divisors, whose sum is σ = 21112102220234. Its totient is φ = 21112102220232.
The previous prime is 21112102220203. The next prime is 21112102220257. The reversal of 21112102220233 is 33202220121112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12435024426889 + 8677077793344 = 3526333^2 + 2945688^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112102220233 - 25 = 21112102220201 is a prime.
It is not a weakly prime, because it can be changed into another prime (21112102220203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556051110116 + 10556051110117.
It is an arithmetic number, because the mean of its divisors is an integer number (10556051110117).
Almost surely, 221112102220233 is an apocalyptic number.
It is an amenable number.
21112102220233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112102220233 is an equidigital number, since it uses as much as digits as its factorization.
21112102220233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 21112102220233 its reverse (33202220121112), we get a palindrome (54314322341345).
The spelling of 21112102220233 in words is "twenty-one trillion, one hundred twelve billion, one hundred two million, two hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •