Base | Representation |
---|---|
bin | 11000111010100101011… |
… | …011011010010100011101 |
3 | 20001200102020110022211012 |
4 | 120322211123122110131 |
5 | 211023012114111031 |
6 | 3350321112505005 |
7 | 234462141233534 |
oct | 30724533322435 |
9 | 6050366408735 |
10 | 1712172410141 |
11 | 600145764486 |
12 | 2379b70ab165 |
13 | c55c351461b |
14 | 5cc2620931b |
15 | 2e80e298b2b |
hex | 18ea56da51d |
1712172410141 has 2 divisors, whose sum is σ = 1712172410142. Its totient is φ = 1712172410140.
The previous prime is 1712172410129. The next prime is 1712172410153. The reversal of 1712172410141 is 1410142712171.
It is a balanced prime because it is at equal distance from previous prime (1712172410129) and next prime (1712172410153).
It can be written as a sum of positive squares in only one way, i.e., 1498200480100 + 213971930041 = 1224010^2 + 462571^2 .
It is a cyclic number.
It is not a de Polignac number, because 1712172410141 - 230 = 1711098668317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1712172410098 and 1712172410107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1712172410171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 856086205070 + 856086205071.
It is an arithmetic number, because the mean of its divisors is an integer number (856086205071).
Almost surely, 21712172410141 is an apocalyptic number.
It is an amenable number.
1712172410141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1712172410141 is an equidigital number, since it uses as much as digits as its factorization.
1712172410141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3136, while the sum is 32.
The spelling of 1712172410141 in words is "one trillion, seven hundred twelve billion, one hundred seventy-two million, four hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •