Base | Representation |
---|---|
bin | 100110101011011101010000… |
… | …100011010000000111011001 |
3 | 211022022120010012120212202002 |
4 | 212223131100203100013121 |
5 | 134244104111001023001 |
6 | 1401444232442450345 |
7 | 50555123641416656 |
oct | 4653352043200731 |
9 | 738276105525662 |
10 | 170112121111001 |
11 | 4a22616660a503 |
12 | 170b4a512039b5 |
13 | 73bc6729196c4 |
14 | 3001683440c2d |
15 | 14a00176e546b |
hex | 9ab7508d01d9 |
170112121111001 has 2 divisors, whose sum is σ = 170112121111002. Its totient is φ = 170112121111000.
The previous prime is 170112121110959. The next prime is 170112121111081. The reversal of 170112121111001 is 100111121211071.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114513862243225 + 55598258867776 = 10701115^2 + 7456424^2 .
It is an emirp because it is prime and its reverse (100111121211071) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-170112121111001 is a prime.
It is not a weakly prime, because it can be changed into another prime (170112121111081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 85056060555500 + 85056060555501.
It is an arithmetic number, because the mean of its divisors is an integer number (85056060555501).
Almost surely, 2170112121111001 is an apocalyptic number.
It is an amenable number.
170112121111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
170112121111001 is an equidigital number, since it uses as much as digits as its factorization.
170112121111001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 20.
Adding to 170112121111001 its reverse (100111121211071), we get a palindrome (270223242322072).
The spelling of 170112121111001 in words is "one hundred seventy trillion, one hundred twelve billion, one hundred twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •