Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …01001110011010000111001 |
3 | 2122011202022122201111101111 |
4 | 10210201221021303100321 |
5 | 10113323312021402413 |
6 | 110430454525120321 |
7 | 4143223350151612 |
oct | 444415111632071 |
9 | 78152278644344 |
10 | 20102211122233 |
11 | 6450333129a89 |
12 | 2307b399b90a1 |
13 | b2a826c1a416 |
14 | 4d6d48c12c09 |
15 | 24cd88287d3d |
hex | 124869273439 |
20102211122233 has 2 divisors, whose sum is σ = 20102211122234. Its totient is φ = 20102211122232.
The previous prime is 20102211122171. The next prime is 20102211122251. The reversal of 20102211122233 is 33222111220102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18537778024704 + 1564433097529 = 4305552^2 + 1250773^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20102211122233 is a prime.
It is not a weakly prime, because it can be changed into another prime (20102211122263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051105561116 + 10051105561117.
It is an arithmetic number, because the mean of its divisors is an integer number (10051105561117).
Almost surely, 220102211122233 is an apocalyptic number.
It is an amenable number.
20102211122233 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102211122233 is an equidigital number, since it uses as much as digits as its factorization.
20102211122233 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 20102211122233 its reverse (33222111220102), we get a palindrome (53324322342335).
The spelling of 20102211122233 in words is "twenty trillion, one hundred two billion, two hundred eleven million, one hundred twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •