Base | Representation |
---|---|
bin | 1001001100100000101111… |
… | …00011000101001111100101 |
3 | 2122121010012022012020110102 |
4 | 10212100113203011033211 |
5 | 10122300303340231203 |
6 | 111001240130033445 |
7 | 4154632510255565 |
oct | 446202743051745 |
9 | 78533168166412 |
10 | 20221101102053 |
11 | 64967a2455555 |
12 | 2326b99a18885 |
13 | b38ac3155cc7 |
14 | 4dc9c696cda5 |
15 | 250ee5a78888 |
hex | 1264178c53e5 |
20221101102053 has 2 divisors, whose sum is σ = 20221101102054. Its totient is φ = 20221101102052.
The previous prime is 20221101101977. The next prime is 20221101102071. The reversal of 20221101102053 is 35020110112202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19791260895169 + 429840206884 = 4448737^2 + 655622^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221101102053 - 28 = 20221101101797 is a prime.
It is a super-2 number, since 2×202211011020532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221101102953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110550551026 + 10110550551027.
It is an arithmetic number, because the mean of its divisors is an integer number (10110550551027).
Almost surely, 220221101102053 is an apocalyptic number.
It is an amenable number.
20221101102053 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221101102053 is an equidigital number, since it uses as much as digits as its factorization.
20221101102053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 20221101102053 its reverse (35020110112202), we get a palindrome (55241211214255).
The spelling of 20221101102053 in words is "twenty trillion, two hundred twenty-one billion, one hundred one million, one hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •