Base | Representation |
---|---|
bin | 1001001100011111010011… |
… | …10001011011101110000001 |
3 | 2122121001012210002022102112 |
4 | 10212033221301123232001 |
5 | 10122242220234042233 |
6 | 111001032013225105 |
7 | 4154604463412234 |
oct | 446175161335601 |
9 | 78531183068375 |
10 | 20220333112193 |
11 | 6496438998395 |
12 | 2326a04792195 |
13 | b38a00000036 |
14 | 4dc95297741b |
15 | 250e9d426048 |
hex | 1263e9c5bb81 |
20220333112193 has 2 divisors, whose sum is σ = 20220333112194. Its totient is φ = 20220333112192.
The previous prime is 20220333112181. The next prime is 20220333112283. The reversal of 20220333112193 is 39121133302202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18533989332544 + 1686343779649 = 4305112^2 + 1298593^2 .
It is a cyclic number.
It is not a de Polignac number, because 20220333112193 - 216 = 20220333046657 is a prime.
It is not a weakly prime, because it can be changed into another prime (20220333112123) 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, 10110166556096 + 10110166556097.
It is an arithmetic number, because the mean of its divisors is an integer number (10110166556097).
Almost surely, 220220333112193 is an apocalyptic number.
It is an amenable number.
20220333112193 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220333112193 is an equidigital number, since it uses as much as digits as its factorization.
20220333112193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 20220333112193 its reverse (39121133302202), we get a palindrome (59341466414395).
The spelling of 20220333112193 in words is "twenty trillion, two hundred twenty billion, three hundred thirty-three million, one hundred twelve thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •