Base | Representation |
---|---|
bin | 100100000010111000111101… |
… | …1010001111100011010011101 |
3 | 1112120121022101101122100221202 |
4 | 1020011301323101330122131 |
5 | 313024123310321422224 |
6 | 3042153434205205245 |
7 | 123532402656223052 |
oct | 11005617321743235 |
9 | 1476538341570852 |
10 | 317056554092189 |
11 | 92029a2515734a |
12 | 2b687826560825 |
13 | 107bb3c6738422 |
14 | 5841894b33029 |
15 | 269c57de2deae |
hex | 1205c7b47c69d |
317056554092189 has 2 divisors, whose sum is σ = 317056554092190. Its totient is φ = 317056554092188.
The previous prime is 317056554092167. The next prime is 317056554092197. The reversal of 317056554092189 is 981290455650713.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 275963261828164 + 41093292264025 = 16612142^2 + 6410405^2 .
It is a cyclic number.
It is not a de Polignac number, because 317056554092189 - 232 = 317052259124893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (317056554092149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 158528277046094 + 158528277046095.
It is an arithmetic number, because the mean of its divisors is an integer number (158528277046095).
It is a 1-persistent number, because it is pandigital, but 2⋅317056554092189 = 634113108184378 is not.
Almost surely, 2317056554092189 is an apocalyptic number.
It is an amenable number.
317056554092189 is a deficient number, since it is larger than the sum of its proper divisors (1).
317056554092189 is an equidigital number, since it uses as much as digits as its factorization.
317056554092189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648000, while the sum is 65.
The spelling of 317056554092189 in words is "three hundred seventeen trillion, fifty-six billion, five hundred fifty-four million, ninety-two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •