Base | Representation |
---|---|
bin | 1001001001000100111110… |
… | …11010010001100010101001 |
3 | 2122011211200002120220202021 |
4 | 10210202133122101202221 |
5 | 10113332143040111332 |
6 | 110431125123504441 |
7 | 4143255042366466 |
oct | 444423732214251 |
9 | 78154602526667 |
10 | 20103121410217 |
11 | 645075aa488aa |
12 | 2308152828121 |
13 | b2a9406a6771 |
14 | 4d6dd3a8a66d |
15 | 24cddd147c97 |
hex | 12489f6918a9 |
20103121410217 has 2 divisors, whose sum is σ = 20103121410218. Its totient is φ = 20103121410216.
The previous prime is 20103121410199. The next prime is 20103121410247. The reversal of 20103121410217 is 71201412130102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18185627620521 + 1917493789696 = 4264461^2 + 1384736^2 .
It is a cyclic number.
It is not a de Polignac number, because 20103121410217 - 227 = 20102987192489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20103121410191 and 20103121410200.
It is not a weakly prime, because it can be changed into another prime (20103121410247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051560705108 + 10051560705109.
It is an arithmetic number, because the mean of its divisors is an integer number (10051560705109).
Almost surely, 220103121410217 is an apocalyptic number.
It is an amenable number.
20103121410217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20103121410217 is an equidigital number, since it uses as much as digits as its factorization.
20103121410217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 20103121410217 its reverse (71201412130102), we get a palindrome (91304533540319).
The spelling of 20103121410217 in words is "twenty trillion, one hundred three billion, one hundred twenty-one million, four hundred ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •