Base | Representation |
---|---|
bin | 1001000110001000110110… |
… | …10101011110011101100101 |
3 | 2121211011222020002022210121 |
4 | 10203010123111132131211 |
5 | 10110203321023441401 |
6 | 110312503033121541 |
7 | 4133051132621155 |
oct | 443043325363545 |
9 | 77734866068717 |
10 | 20002121312101 |
11 | 6411941032235 |
12 | 22b0665b592b1 |
13 | b212659242b6 |
14 | 4d2171c94765 |
15 | 24a47b20cca1 |
hex | 12311b55e765 |
20002121312101 has 2 divisors, whose sum is σ = 20002121312102. Its totient is φ = 20002121312100.
The previous prime is 20002121312081. The next prime is 20002121312123. The reversal of 20002121312101 is 10121312120002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18113280640900 + 1888840671201 = 4255970^2 + 1374351^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002121312101 - 27 = 20002121311973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20002121312191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001060656050 + 10001060656051.
It is an arithmetic number, because the mean of its divisors is an integer number (10001060656051).
Almost surely, 220002121312101 is an apocalyptic number.
It is an amenable number.
20002121312101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002121312101 is an equidigital number, since it uses as much as digits as its factorization.
20002121312101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20002121312101 its reverse (10121312120002), we get a palindrome (30123433432103).
The spelling of 20002121312101 in words is "twenty trillion, two billion, one hundred twenty-one million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •