Base | Representation |
---|---|
bin | 1001001100100000111110… |
… | …10011000111000111101001 |
3 | 2122121010112100212111121101 |
4 | 10212100133103013013221 |
5 | 10122301040132230121 |
6 | 111001301053041401 |
7 | 4154635646436202 |
oct | 446203723070751 |
9 | 78533470774541 |
10 | 20221231133161 |
11 | 6496859898883 |
12 | 2327015486261 |
13 | b38b140829a6 |
14 | 4dc9d9d3a5a9 |
15 | 2510021b1491 |
hex | 12641f4c71e9 |
20221231133161 has 2 divisors, whose sum is σ = 20221231133162. Its totient is φ = 20221231133160.
The previous prime is 20221231133141. The next prime is 20221231133203. The reversal of 20221231133161 is 16133113212202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18276001201936 + 1945229931225 = 4275044^2 + 1394715^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221231133161 is a prime.
It is a super-2 number, since 2×202212311331612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20221231133141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110615566580 + 10110615566581.
It is an arithmetic number, because the mean of its divisors is an integer number (10110615566581).
Almost surely, 220221231133161 is an apocalyptic number.
It is an amenable number.
20221231133161 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221231133161 is an equidigital number, since it uses as much as digits as its factorization.
20221231133161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 20221231133161 its reverse (16133113212202), we get a palindrome (36354344345363).
The spelling of 20221231133161 in words is "twenty trillion, two hundred twenty-one billion, two hundred thirty-one million, one hundred thirty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •