Base | Representation |
---|---|
bin | 1001000111000010100111… |
… | …01010111011010000001101 |
3 | 2121221011000100201101101112 |
4 | 10203201103222323100031 |
5 | 10111210323043331341 |
6 | 110335032103221405 |
7 | 4135226444566544 |
oct | 443412352732015 |
9 | 77834010641345 |
10 | 20033131230221 |
11 | 642400435373a |
12 | 22b667b147865 |
13 | b241682b9a85 |
14 | 4d38744ad15b |
15 | 24b193826aeb |
hex | 123853abb40d |
20033131230221 has 2 divisors, whose sum is σ = 20033131230222. Its totient is φ = 20033131230220.
The previous prime is 20033131230179. The next prime is 20033131230223. The reversal of 20033131230221 is 12203213133002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15767935624996 + 4265195605225 = 3970886^2 + 2065235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20033131230221 is a prime.
Together with 20033131230223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20033131230223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10016565615110 + 10016565615111.
It is an arithmetic number, because the mean of its divisors is an integer number (10016565615111).
Almost surely, 220033131230221 is an apocalyptic number.
It is an amenable number.
20033131230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20033131230221 is an equidigital number, since it uses as much as digits as its factorization.
20033131230221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20033131230221 its reverse (12203213133002), we get a palindrome (32236344363223).
The spelling of 20033131230221 in words is "twenty trillion, thirty-three billion, one hundred thirty-one million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •