Base | Representation |
---|---|
bin | 1001001100001100011110… |
… | …00111000100010000010001 |
3 | 2122120002010010110210101022 |
4 | 10212012033013010100101 |
5 | 10122111013330401001 |
6 | 110552240423445225 |
7 | 4154066100412562 |
oct | 446061707042021 |
9 | 78502103423338 |
10 | 20210222122001 |
11 | 649211a56584a |
12 | 2324a625b6815 |
13 | b37a7b3218c2 |
14 | 4dc273ba2169 |
15 | 250aaa94211b |
hex | 12618f1c4411 |
20210222122001 has 2 divisors, whose sum is σ = 20210222122002. Its totient is φ = 20210222122000.
The previous prime is 20210222121917. The next prime is 20210222122037. The reversal of 20210222122001 is 10022122201202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15443335899601 + 4766886222400 = 3929801^2 + 2183320^2 .
It is a cyclic number.
It is not a de Polignac number, because 20210222122001 - 230 = 20209148380177 is a prime.
It is not a weakly prime, because it can be changed into another prime (20210222122201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10105111061000 + 10105111061001.
It is an arithmetic number, because the mean of its divisors is an integer number (10105111061001).
Almost surely, 220210222122001 is an apocalyptic number.
It is an amenable number.
20210222122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20210222122001 is an equidigital number, since it uses as much as digits as its factorization.
20210222122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20210222122001 its reverse (10022122201202), we get a palindrome (30232344323203).
The spelling of 20210222122001 in words is "twenty trillion, two hundred ten billion, two hundred twenty-two million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •