Base | Representation |
---|---|
bin | 1001001001010001110100… |
… | …11011100001011110100101 |
3 | 2122012111110200011222112011 |
4 | 10210220322123201132211 |
5 | 10113440303344022123 |
6 | 110434225255554221 |
7 | 4143620654406406 |
oct | 444507233413645 |
9 | 78174420158464 |
10 | 20110017173413 |
11 | 6453679477852 |
12 | 230955808b971 |
13 | b2b49c21460b |
14 | 4d74898319ad |
15 | 24d193721e0d |
hex | 124a3a6e17a5 |
20110017173413 has 2 divisors, whose sum is σ = 20110017173414. Its totient is φ = 20110017173412.
The previous prime is 20110017173401. The next prime is 20110017173461. The reversal of 20110017173413 is 31437171001102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17899389408289 + 2210627765124 = 4230767^2 + 1486818^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110017173413 - 29 = 20110017172901 is a prime.
It is a super-2 number, since 2×201100171734132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110017173483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055008586706 + 10055008586707.
It is an arithmetic number, because the mean of its divisors is an integer number (10055008586707).
Almost surely, 220110017173413 is an apocalyptic number.
It is an amenable number.
20110017173413 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110017173413 is an equidigital number, since it uses as much as digits as its factorization.
20110017173413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3528, while the sum is 31.
Adding to 20110017173413 its reverse (31437171001102), we get a palindrome (51547188174515).
The spelling of 20110017173413 in words is "twenty trillion, one hundred ten billion, seventeen million, one hundred seventy-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •