Base | Representation |
---|---|
bin | 1100001011011111000… |
… | …00000101100101010001 |
3 | 1111000011202200011112012 |
4 | 12011233200011211101 |
5 | 23324023010311121 |
6 | 520125340312305 |
7 | 42143246434202 |
oct | 6055740054521 |
9 | 1430152604465 |
10 | 418482510161 |
11 | 151528515891 |
12 | 69130b42695 |
13 | 3060280bca1 |
14 | 1637cb115a9 |
15 | ad44312c5b |
hex | 616f805951 |
418482510161 has 2 divisors, whose sum is σ = 418482510162. Its totient is φ = 418482510160.
The previous prime is 418482510091. The next prime is 418482510167. The reversal of 418482510161 is 161015284814.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 409912379536 + 8570130625 = 640244^2 + 92575^2 .
It is a cyclic number.
It is not a de Polignac number, because 418482510161 - 226 = 418415401297 is a prime.
It is a super-2 number, since 2×4184825101612 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (418482510167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 209241255080 + 209241255081.
It is an arithmetic number, because the mean of its divisors is an integer number (209241255081).
Almost surely, 2418482510161 is an apocalyptic number.
It is an amenable number.
418482510161 is a deficient number, since it is larger than the sum of its proper divisors (1).
418482510161 is an equidigital number, since it uses as much as digits as its factorization.
418482510161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61440, while the sum is 41.
Adding to 418482510161 its reverse (161015284814), we get a palindrome (579497794975).
The spelling of 418482510161 in words is "four hundred eighteen billion, four hundred eighty-two million, five hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •