Base | Representation |
---|---|
bin | 111000000010… |
… | …000110000001 |
3 | 1000122021000202 |
4 | 320002012001 |
5 | 12230014031 |
6 | 1242454545 |
7 | 235565012 |
oct | 70020601 |
9 | 30567022 |
10 | 14688641 |
11 | 8322880 |
12 | 4b04455 |
13 | 3073a06 |
14 | 1d45009 |
15 | 14522cb |
hex | e02181 |
14688641 has 4 divisors (see below), whose sum is σ = 16023984. Its totient is φ = 13353300.
The previous prime is 14688623. The next prime is 14688643.
14688641 is nontrivially palindromic in base 10.
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 a de Polignac number, because none of the positive numbers 2k-14688641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14688595 and 14688604.
It is not an unprimeable number, because it can be changed into a prime (14688643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667655 + ... + 667676.
It is an arithmetic number, because the mean of its divisors is an integer number (4005996).
Almost surely, 214688641 is an apocalyptic number.
14688641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14688641 is a deficient number, since it is larger than the sum of its proper divisors (1335343).
14688641 is a wasteful number, since it uses less digits than its factorization.
14688641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1335342.
The product of its digits is 36864, while the sum is 38.
The square root of 14688641 is about 3832.5762875643. The cubic root of 14688641 is about 244.9028686189.
The spelling of 14688641 in words is "fourteen million, six hundred eighty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •