Base | Representation |
---|---|
bin | 1001001011111001101001… |
… | …00000011001001100000101 |
3 | 2122112010000112200110120202 |
4 | 10211330310200121030011 |
5 | 10121424312144200401 |
6 | 110543445310540245 |
7 | 4153260415555223 |
oct | 445746440311405 |
9 | 78463015613522 |
10 | 20200112100101 |
11 | 648890173474a |
12 | 2322b00807685 |
13 | b36b298c211b |
14 | 4db99519db13 |
15 | 2506b80a006b |
hex | 125f34819305 |
20200112100101 has 2 divisors, whose sum is σ = 20200112100102. Its totient is φ = 20200112100100.
The previous prime is 20200112100031. The next prime is 20200112100121. The reversal of 20200112100101 is 10100121100202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17862879602500 + 2337232497601 = 4226450^2 + 1528801^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200112100101 - 222 = 20200107905797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200112100121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100056050050 + 10100056050051.
It is an arithmetic number, because the mean of its divisors is an integer number (10100056050051).
Almost surely, 220200112100101 is an apocalyptic number.
It is an amenable number.
20200112100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200112100101 is an equidigital number, since it uses as much as digits as its factorization.
20200112100101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20200112100101 its reverse (10100121100202), we get a palindrome (30300233200303).
The spelling of 20200112100101 in words is "twenty trillion, two hundred billion, one hundred twelve million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •