Base | Representation |
---|---|
bin | 10001010110011100… |
… | …111101001111011101 |
3 | 1210002101012022221201 |
4 | 101112130331033131 |
5 | 301123324110022 |
6 | 12320355555501 |
7 | 1226450641204 |
oct | 212634751735 |
9 | 53071168851 |
10 | 18630300637 |
11 | 79a0356683 |
12 | 373b2bbb91 |
13 | 19ab9a7c40 |
14 | c8a42023b |
15 | 7408ae127 |
hex | 45673d3dd |
18630300637 has 4 divisors (see below), whose sum is σ = 20063400700. Its totient is φ = 17197200576.
The previous prime is 18630300589. The next prime is 18630300659. The reversal of 18630300637 is 73600303681.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73600303681 = 19501 ⋅3774181.
It can be written as a sum of positive squares in 2 ways, for example, as 12079988281 + 6550312356 = 109909^2 + 80934^2 .
It is a cyclic number.
It is not a de Polignac number, because 18630300637 - 27 = 18630300509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 18630300596 and 18630300605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18630300037) 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, 716550012 + ... + 716550037.
It is an arithmetic number, because the mean of its divisors is an integer number (5015850175).
Almost surely, 218630300637 is an apocalyptic number.
It is an amenable number.
18630300637 is a deficient number, since it is larger than the sum of its proper divisors (1433100063).
18630300637 is a wasteful number, since it uses less digits than its factorization.
18630300637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1433100062.
The product of its (nonzero) digits is 54432, while the sum is 37.
The spelling of 18630300637 in words is "eighteen billion, six hundred thirty million, three hundred thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •