Base | Representation |
---|---|
bin | 1001001011111001101010… |
… | …00110001111100010000101 |
3 | 2122112010001020100112220021 |
4 | 10211330311012033202011 |
5 | 10121424322214201041 |
6 | 110543450303335141 |
7 | 4153260566111134 |
oct | 445746506174205 |
9 | 78463036315807 |
10 | 20200122022021 |
11 | 64889072a1187 |
12 | 2322b03bb14b1 |
13 | b36b2b987296 |
14 | 4db99662391b |
15 | 2506b8daecd1 |
hex | 125f3518f885 |
20200122022021 has 2 divisors, whose sum is σ = 20200122022022. Its totient is φ = 20200122022020.
The previous prime is 20200122022013. The next prime is 20200122022063. The reversal of 20200122022021 is 12022022100202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19810608729921 + 389513292100 = 4450911^2 + 624110^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200122022021 - 23 = 20200122022013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20200122021986 and 20200122022004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200122022321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100061011010 + 10100061011011.
It is an arithmetic number, because the mean of its divisors is an integer number (10100061011011).
Almost surely, 220200122022021 is an apocalyptic number.
It is an amenable number.
20200122022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200122022021 is an equidigital number, since it uses as much as digits as its factorization.
20200122022021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20200122022021 its reverse (12022022100202), we get a palindrome (32222144122223).
The spelling of 20200122022021 in words is "twenty trillion, two hundred billion, one hundred twenty-two million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •