Base | Representation |
---|---|
bin | 1001001001101000010101… |
… | …10000001111101010110101 |
3 | 2122020122122220021222210222 |
4 | 10210310022300033222311 |
5 | 10114140031130413023 |
6 | 110443544404024125 |
7 | 4144526310426131 |
oct | 444641260175265 |
9 | 78218586258728 |
10 | 20122102201013 |
11 | 645881012396a |
12 | 230b96b392045 |
13 | b2c676b79a17 |
14 | 4d7cb48643c1 |
15 | 24d64e68acc8 |
hex | 124d0ac0fab5 |
20122102201013 has 2 divisors, whose sum is σ = 20122102201014. Its totient is φ = 20122102201012.
The previous prime is 20122102200947. The next prime is 20122102201021. The reversal of 20122102201013 is 31010220122102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13358893420324 + 6763208780689 = 3654982^2 + 2600617^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122102201013 - 210 = 20122102199989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20122102200982 and 20122102201000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20122102207013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061051100506 + 10061051100507.
It is an arithmetic number, because the mean of its divisors is an integer number (10061051100507).
Almost surely, 220122102201013 is an apocalyptic number.
It is an amenable number.
20122102201013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122102201013 is an equidigital number, since it uses as much as digits as its factorization.
20122102201013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20122102201013 its reverse (31010220122102), we get a palindrome (51132322323115).
The spelling of 20122102201013 in words is "twenty trillion, one hundred twenty-two billion, one hundred two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •