Base | Representation |
---|---|
bin | 1100101100100011101… |
… | …0000110101000011001 |
3 | 202212000002110021000221 |
4 | 3023020322012220121 |
5 | 12033201433231023 |
6 | 244111424000041 |
7 | 21521123150044 |
oct | 3131072065031 |
9 | 685002407027 |
10 | 218119039513 |
11 | 8455a569821 |
12 | 36333760021 |
13 | 177510cb42b |
14 | a7b2657c5b |
15 | 5a18ee385d |
hex | 32c8e86a19 |
218119039513 has 2 divisors, whose sum is σ = 218119039514. Its totient is φ = 218119039512.
The previous prime is 218119039487. The next prime is 218119039543. The reversal of 218119039513 is 315930911812.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127486130704 + 90632908809 = 357052^2 + 301053^2 .
It is a cyclic number.
It is not a de Polignac number, because 218119039513 - 213 = 218119031321 is a prime.
It is a super-3 number, since 3×2181190395133 (a number of 35 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 218119039513.
It is not a weakly prime, because it can be changed into another prime (218119039543) 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, 109059519756 + 109059519757.
It is an arithmetic number, because the mean of its divisors is an integer number (109059519757).
Almost surely, 2218119039513 is an apocalyptic number.
It is an amenable number.
218119039513 is a deficient number, since it is larger than the sum of its proper divisors (1).
218119039513 is an equidigital number, since it uses as much as digits as its factorization.
218119039513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 43.
The spelling of 218119039513 in words is "two hundred eighteen billion, one hundred nineteen million, thirty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •