Base | Representation |
---|---|
bin | 10001010101111000… |
… | …000111000000111001 |
3 | 1210001201000120212212 |
4 | 101111320013000321 |
5 | 301113341010322 |
6 | 12315412544505 |
7 | 1226302561034 |
oct | 212570070071 |
9 | 53051016785 |
10 | 18620641337 |
11 | 7995959491 |
12 | 3738022135 |
13 | 19a99a548c |
14 | c8902801b |
15 | 73eb020e2 |
hex | 455e07039 |
18620641337 has 4 divisors (see below), whose sum is σ = 18645240036. Its totient is φ = 18596042640.
The previous prime is 18620641313. The next prime is 18620641343. The reversal of 18620641337 is 73314602681.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8432565241 + 10188076096 = 91829^2 + 100936^2 .
It is a cyclic number.
It is not a de Polignac number, because 18620641337 - 228 = 18352205881 is a prime.
It is a super-3 number, since 3×186206413373 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 18620641294 and 18620641303.
It is not an unprimeable number, because it can be changed into a prime (18620641357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12298214 + ... + 12299727.
It is an arithmetic number, because the mean of its divisors is an integer number (4661310009).
Almost surely, 218620641337 is an apocalyptic number.
It is an amenable number.
18620641337 is a deficient number, since it is larger than the sum of its proper divisors (24598699).
18620641337 is an equidigital number, since it uses as much as digits as its factorization.
18620641337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24598698.
The product of its (nonzero) digits is 145152, while the sum is 41.
The spelling of 18620641337 in words is "eighteen billion, six hundred twenty million, six hundred forty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •