Base | Representation |
---|---|
bin | 100011011111000100110001… |
… | …1011010001011001101111001 |
3 | 1111221011201201120111021012011 |
4 | 1012332021203122023031321 |
5 | 311403001134443404302 |
6 | 3023504234034245521 |
7 | 122513642333024413 |
oct | 10676114332131571 |
9 | 1457151646437164 |
10 | 312134121075577 |
11 | 90501379033539 |
12 | 2b0118257268a1 |
13 | 10522176700288 |
14 | 571152cd4d9b3 |
15 | 26144d12d25d7 |
hex | 11be26368b379 |
312134121075577 has 2 divisors, whose sum is σ = 312134121075578. Its totient is φ = 312134121075576.
The previous prime is 312134121075461. The next prime is 312134121075631. The reversal of 312134121075577 is 775570121431213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196435249367296 + 115698871708281 = 14015536^2 + 10756341^2 .
It is a cyclic number.
It is not a de Polignac number, because 312134121075577 - 211 = 312134121073529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 312134121075577.
It is not a weakly prime, because it can be changed into another prime (312134121072577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156067060537788 + 156067060537789.
It is an arithmetic number, because the mean of its divisors is an integer number (156067060537789).
Almost surely, 2312134121075577 is an apocalyptic number.
It is an amenable number.
312134121075577 is a deficient number, since it is larger than the sum of its proper divisors (1).
312134121075577 is an equidigital number, since it uses as much as digits as its factorization.
312134121075577 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1234800, while the sum is 49.
The spelling of 312134121075577 in words is "three hundred twelve trillion, one hundred thirty-four billion, one hundred twenty-one million, seventy-five thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •