Base | Representation |
---|---|
bin | 1001000110000101000111… |
… | …00100101001001000000101 |
3 | 2121210222210012020210222111 |
4 | 10203002203210221020011 |
5 | 10110140212134201041 |
6 | 110311531415101021 |
7 | 4132650264134455 |
oct | 443024344511005 |
9 | 77728705223874 |
10 | 20000112022021 |
11 | 6410aaa91a91a |
12 | 22b01a5071771 |
13 | b21005576561 |
14 | 4d202109bd65 |
15 | 24a3aeb12981 |
hex | 1230a3929205 |
20000112022021 has 2 divisors, whose sum is σ = 20000112022022. Its totient is φ = 20000112022020.
The previous prime is 20000112022003. The next prime is 20000112022127. The reversal of 20000112022021 is 12022021100002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19685957376996 + 314154645025 = 4436886^2 + 560495^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000112022021 - 219 = 20000111497733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20000112021992 and 20000112022010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000112022721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000056011010 + 10000056011011.
It is an arithmetic number, because the mean of its divisors is an integer number (10000056011011).
Almost surely, 220000112022021 is an apocalyptic number.
It is an amenable number.
20000112022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000112022021 is an equidigital number, since it uses as much as digits as its factorization.
20000112022021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20000112022021 its reverse (12022021100002), we get a palindrome (32022133122023).
The spelling of 20000112022021 in words is "twenty trillion, one hundred twelve million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •