Base | Representation |
---|---|
bin | 100100010000101010010100… |
… | …1000000000010000100111101 |
3 | 1112211022020202220220002121022 |
4 | 1020201110221000002010331 |
5 | 313301131033041230441 |
6 | 3050203133054113525 |
7 | 124116215565111302 |
oct | 11041245100020475 |
9 | 1484266686802538 |
10 | 318949254242621 |
11 | 9269968a037002 |
12 | 2b932603aab8a5 |
13 | 108c7a2a00c942 |
14 | 58a9324c710a9 |
15 | 26d1906dc884b |
hex | 122152900213d |
318949254242621 has 2 divisors, whose sum is σ = 318949254242622. Its totient is φ = 318949254242620.
The previous prime is 318949254242539. The next prime is 318949254242623. The reversal of 318949254242621 is 126242452949813.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 312127305765625 + 6821948476996 = 17667125^2 + 2611886^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-318949254242621 is a prime.
Together with 318949254242623, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (318949254242623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 159474627121310 + 159474627121311.
It is an arithmetic number, because the mean of its divisors is an integer number (159474627121311).
Almost surely, 2318949254242621 is an apocalyptic number.
It is an amenable number.
318949254242621 is a deficient number, since it is larger than the sum of its proper divisors (1).
318949254242621 is an equidigital number, since it uses as much as digits as its factorization.
318949254242621 is an evil number, because the sum of its binary digits is even.
The product of its digits is 59719680, while the sum is 62.
The spelling of 318949254242621 in words is "three hundred eighteen trillion, nine hundred forty-nine billion, two hundred fifty-four million, two hundred forty-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •