Base | Representation |
---|---|
bin | 1001111101111000001… |
… | …1001001000100101101 |
3 | 121100222020202000202121 |
4 | 2133132003021010231 |
5 | 10301134121340333 |
6 | 210354521352541 |
7 | 15241134152125 |
oct | 2373603110455 |
9 | 540866660677 |
10 | 171229090093 |
11 | 666883a2806 |
12 | 29228338751 |
13 | 131ba795329 |
14 | 8404db9c85 |
15 | 46c26d032d |
hex | 27de0c912d |
171229090093 has 2 divisors, whose sum is σ = 171229090094. Its totient is φ = 171229090092.
The previous prime is 171229090091. The next prime is 171229090133. The reversal of 171229090093 is 390090922171.
171229090093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110268492489 + 60960597604 = 332067^2 + 246902^2 .
It is a cyclic number.
It is not a de Polignac number, because 171229090093 - 21 = 171229090091 is a prime.
Together with 171229090091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (171229090091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 85614545046 + 85614545047.
It is an arithmetic number, because the mean of its divisors is an integer number (85614545047).
Almost surely, 2171229090093 is an apocalyptic number.
It is an amenable number.
171229090093 is a deficient number, since it is larger than the sum of its proper divisors (1).
171229090093 is an equidigital number, since it uses as much as digits as its factorization.
171229090093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 43.
The spelling of 171229090093 in words is "one hundred seventy-one billion, two hundred twenty-nine million, ninety thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •