Base | Representation |
---|---|
bin | 100011111110… |
… | …1011110011101 |
3 | 1022111101120202 |
4 | 1013331132131 |
5 | 14312122104 |
6 | 1512153245 |
7 | 316225112 |
oct | 107753635 |
9 | 38441522 |
10 | 18864029 |
11 | a714908 |
12 | 6398825 |
13 | 3ba6362 |
14 | 2710909 |
15 | 19c951e |
hex | 11fd79d |
18864029 has 2 divisors, whose sum is σ = 18864030. Its totient is φ = 18864028.
The previous prime is 18864023. The next prime is 18864037. The reversal of 18864029 is 92046881.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18705625 + 158404 = 4325^2 + 398^2 .
It is an emirp because it is prime and its reverse (92046881) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 18864029 - 28 = 18863773 is a prime.
It is a super-2 number, since 2×188640292 = 711703180225682, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 18863983 and 18864001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18864023) 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, 9432014 + 9432015.
It is an arithmetic number, because the mean of its divisors is an integer number (9432015).
Almost surely, 218864029 is an apocalyptic number.
It is an amenable number.
18864029 is a deficient number, since it is larger than the sum of its proper divisors (1).
18864029 is an equidigital number, since it uses as much as digits as its factorization.
18864029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 38.
The square root of 18864029 is about 4343.2739955016. The cubic root of 18864029 is about 266.2021048690.
The spelling of 18864029 in words is "eighteen million, eight hundred sixty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •