Base | Representation |
---|---|
bin | 1001000110001001001111… |
… | …10010010100110000100001 |
3 | 2121211012111210010222122222 |
4 | 10203010213302110300201 |
5 | 10110204233012413441 |
6 | 110312535454240425 |
7 | 4133056250300102 |
oct | 443044762246041 |
9 | 77735453128588 |
10 | 20002330201121 |
11 | 6411a38a36694 |
12 | 22b0703ab6115 |
13 | b21299ca1578 |
14 | 4d219190c3a9 |
15 | 24a48e720d4b |
hex | 123127c94c21 |
20002330201121 has 2 divisors, whose sum is σ = 20002330201122. Its totient is φ = 20002330201120.
The previous prime is 20002330201081. The next prime is 20002330201163. The reversal of 20002330201121 is 12110203320002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14447182893025 + 5555147308096 = 3800945^2 + 2356936^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002330201121 - 26 = 20002330201057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20002330201121.
It is not a weakly prime, because it can be changed into another prime (20002330101121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001165100560 + 10001165100561.
It is an arithmetic number, because the mean of its divisors is an integer number (10001165100561).
Almost surely, 220002330201121 is an apocalyptic number.
It is an amenable number.
20002330201121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002330201121 is an equidigital number, since it uses as much as digits as its factorization.
20002330201121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20002330201121 its reverse (12110203320002), we get a palindrome (32112533521123).
The spelling of 20002330201121 in words is "twenty trillion, two billion, three hundred thirty million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •