Base | Representation |
---|---|
bin | 1001010001111100111… |
… | …00101010101010001001 |
3 | 1010111001222002201000202 |
4 | 10220332130222222021 |
5 | 20211024033011212 |
6 | 402253403541545 |
7 | 32016012114233 |
oct | 4507634525211 |
9 | 1114058081022 |
10 | 318875282057 |
11 | 113263869062 |
12 | 5197282a8b5 |
13 | 240ba4acb67 |
14 | 1160dcd3253 |
15 | 84648100c2 |
hex | 4a3e72aa89 |
318875282057 has 2 divisors, whose sum is σ = 318875282058. Its totient is φ = 318875282056.
The previous prime is 318875282041. The next prime is 318875282059. The reversal of 318875282057 is 750282578813.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 308492487241 + 10382794816 = 555421^2 + 101896^2 .
It is a cyclic number.
It is not a de Polignac number, because 318875282057 - 24 = 318875282041 is a prime.
Together with 318875282059, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 318875281993 and 318875282011.
It is not a weakly prime, because it can be changed into another prime (318875282059) 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, 159437641028 + 159437641029.
It is an arithmetic number, because the mean of its divisors is an integer number (159437641029).
Almost surely, 2318875282057 is an apocalyptic number.
It is an amenable number.
318875282057 is a deficient number, since it is larger than the sum of its proper divisors (1).
318875282057 is an equidigital number, since it uses as much as digits as its factorization.
318875282057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7526400, while the sum is 56.
The spelling of 318875282057 in words is "three hundred eighteen billion, eight hundred seventy-five million, two hundred eighty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •