Base | Representation |
---|---|
bin | 1001001000111111100011… |
… | …11111110000100101011001 |
3 | 2122011120011100000121202112 |
4 | 10210133301333300211121 |
5 | 10113310213233013423 |
6 | 110425524313042105 |
7 | 4143122664000266 |
oct | 444376177604531 |
9 | 78146140017675 |
10 | 20100212001113 |
11 | 644a4a7732772 |
12 | 23076803b6335 |
13 | b2a5989c010a |
14 | 4d6bd950626d |
15 | 24ccbc9eaa78 |
hex | 1247f1ff0959 |
20100212001113 has 2 divisors, whose sum is σ = 20100212001114. Its totient is φ = 20100212001112.
The previous prime is 20100212001097. The next prime is 20100212001193. The reversal of 20100212001113 is 31110021200102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19233382105744 + 866829895369 = 4385588^2 + 931037^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100212001113 - 24 = 20100212001097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20100212001193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050106000556 + 10050106000557.
It is an arithmetic number, because the mean of its divisors is an integer number (10050106000557).
Almost surely, 220100212001113 is an apocalyptic number.
It is an amenable number.
20100212001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100212001113 is an equidigital number, since it uses as much as digits as its factorization.
20100212001113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 20100212001113 its reverse (31110021200102), we get a palindrome (51210233201215).
The spelling of 20100212001113 in words is "twenty trillion, one hundred billion, two hundred twelve million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •