Base | Representation |
---|---|
bin | 110110001100011… |
… | …1001111100101001 |
3 | 11200201202202022202 |
4 | 1230120321330221 |
5 | 12211011440022 |
6 | 500240025545 |
7 | 63030503243 |
oct | 15430717451 |
9 | 4621682282 |
10 | 1818468137 |
11 | 853529032 |
12 | 4290022b5 |
13 | 22c988165 |
14 | 133723093 |
15 | a99a5592 |
hex | 6c639f29 |
1818468137 has 2 divisors, whose sum is σ = 1818468138. Its totient is φ = 1818468136.
The previous prime is 1818468109. The next prime is 1818468139. The reversal of 1818468137 is 7318648181.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 910590976 + 907877161 = 30176^2 + 30131^2 .
It is a cyclic number.
It is not a de Polignac number, because 1818468137 - 216 = 1818402601 is a prime.
Together with 1818468139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1818468091 and 1818468100.
It is not a weakly prime, because it can be changed into another prime (1818468139) 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, 909234068 + 909234069.
It is an arithmetic number, because the mean of its divisors is an integer number (909234069).
Almost surely, 21818468137 is an apocalyptic number.
It is an amenable number.
1818468137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1818468137 is an equidigital number, since it uses as much as digits as its factorization.
1818468137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 258048, while the sum is 47.
The square root of 1818468137 is about 42643.5005246990. The cubic root of 1818468137 is about 1220.5865085073.
The spelling of 1818468137 in words is "one billion, eight hundred eighteen million, four hundred sixty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •