Base | Representation |
---|---|
bin | 1001010001100001100… |
… | …10011111001010110101 |
3 | 1010110110222220010100102 |
4 | 10220300302133022311 |
5 | 20210041401334031 |
6 | 402214540123445 |
7 | 32010230224505 |
oct | 4506062371265 |
9 | 1113428803312 |
10 | 318646121141 |
11 | 113156479077 |
12 | 51909b36585 |
13 | 24081b8579a |
14 | 115cb6bda05 |
15 | 844e6457cb |
hex | 4a30c9f2b5 |
318646121141 has 2 divisors, whose sum is σ = 318646121142. Its totient is φ = 318646121140.
The previous prime is 318646121113. The next prime is 318646121153. The reversal of 318646121141 is 141121646813.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 291523325041 + 27122796100 = 539929^2 + 164690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-318646121141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 318646121095 and 318646121104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (318646121161) 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, 159323060570 + 159323060571.
It is an arithmetic number, because the mean of its divisors is an integer number (159323060571).
Almost surely, 2318646121141 is an apocalyptic number.
It is an amenable number.
318646121141 is a deficient number, since it is larger than the sum of its proper divisors (1).
318646121141 is an equidigital number, since it uses as much as digits as its factorization.
318646121141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 38.
Adding to 318646121141 its reverse (141121646813), we get a palindrome (459767767954).
The spelling of 318646121141 in words is "three hundred eighteen billion, six hundred forty-six million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •