Base | Representation |
---|---|
bin | 100011010000… |
… | …0001111110001 |
3 | 1021202222202111 |
4 | 1012200033301 |
5 | 14212412121 |
6 | 1500045321 |
7 | 313044565 |
oct | 106401761 |
9 | 37688674 |
10 | 18482161 |
11 | a483a15 |
12 | 6233841 |
13 | 3aa15b9 |
14 | 26516a5 |
15 | 19512e1 |
hex | 11a03f1 |
18482161 has 4 divisors (see below), whose sum is σ = 18493300. Its totient is φ = 18471024.
The previous prime is 18482153. The next prime is 18482171. The reversal of 18482161 is 16128481.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16128481 = 97 ⋅166273.
It can be written as a sum of positive squares in 2 ways, for example, as 11560000 + 6922161 = 3400^2 + 2631^2 .
It is a cyclic number.
It is not a de Polignac number, because 18482161 - 23 = 18482153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18482141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2526 + ... + 6583.
It is an arithmetic number, because the mean of its divisors is an integer number (4623325).
Almost surely, 218482161 is an apocalyptic number.
It is an amenable number.
18482161 is a deficient number, since it is larger than the sum of its proper divisors (11139).
18482161 is an equidigital number, since it uses as much as digits as its factorization.
18482161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11138.
The product of its digits is 3072, while the sum is 31.
The square root of 18482161 is about 4299.0883917407. The cubic root of 18482161 is about 264.3935866713.
The spelling of 18482161 in words is "eighteen million, four hundred eighty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •