Base | Representation |
---|---|
bin | 111000110011… |
… | …011000101101 |
3 | 1001000111222112 |
4 | 320303120231 |
5 | 12302444131 |
6 | 1251053405 |
7 | 240365441 |
oct | 70633055 |
9 | 31014875 |
10 | 14890541 |
11 | 8450536 |
12 | 4ba1265 |
13 | 3114893 |
14 | 1d98821 |
15 | 149202b |
hex | e3362d |
14890541 has 4 divisors (see below), whose sum is σ = 14916000. Its totient is φ = 14865084.
The previous prime is 14890523. The next prime is 14890609. The reversal of 14890541 is 14509841.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14890541 - 214 = 14874157 is a prime.
It is a super-2 number, since 2×148905412 = 443456422545362, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14890498 and 14890507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14890511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11831 + ... + 13028.
It is an arithmetic number, because the mean of its divisors is an integer number (3729000).
Almost surely, 214890541 is an apocalyptic number.
It is an amenable number.
14890541 is a deficient number, since it is larger than the sum of its proper divisors (25459).
14890541 is an equidigital number, since it uses as much as digits as its factorization.
14890541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25458.
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 14890541 is about 3858.8263759853. The cubic root of 14890541 is about 246.0198554049.
The spelling of 14890541 in words is "fourteen million, eight hundred ninety thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •