Base | Representation |
---|---|
bin | 1100101100010000111… |
… | …0101110100110101001 |
3 | 202211210121210002102211 |
4 | 3023010032232212221 |
5 | 12033021340410131 |
6 | 244055541525121 |
7 | 21516151115653 |
oct | 3130416564651 |
9 | 684717702384 |
10 | 218040560041 |
11 | 8451a236a57 |
12 | 363114137a1 |
13 | 1773aa81185 |
14 | a7a60696d3 |
15 | 5a121905b1 |
hex | 32c43ae9a9 |
218040560041 has 2 divisors, whose sum is σ = 218040560042. Its totient is φ = 218040560040.
The previous prime is 218040559967. The next prime is 218040560047. The reversal of 218040560041 is 140065040812.
218040560041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 203008819225 + 15031740816 = 450565^2 + 122604^2 .
It is a cyclic number.
It is not a de Polignac number, because 218040560041 - 229 = 217503689129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 218040559985 and 218040560012.
It is not a weakly prime, because it can be changed into another prime (218040560047) 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, 109020280020 + 109020280021.
It is an arithmetic number, because the mean of its divisors is an integer number (109020280021).
Almost surely, 2218040560041 is an apocalyptic number.
It is an amenable number.
218040560041 is a deficient number, since it is larger than the sum of its proper divisors (1).
218040560041 is an equidigital number, since it uses as much as digits as its factorization.
218040560041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680, while the sum is 31.
The spelling of 218040560041 in words is "two hundred eighteen billion, forty million, five hundred sixty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •