Base | Representation |
---|---|
bin | 110111010000… |
… | …100010111101 |
3 | 1000020221122011 |
4 | 313100202331 |
5 | 12202020233 |
6 | 1234251221 |
7 | 234061225 |
oct | 67204275 |
9 | 30227564 |
10 | 14485693 |
11 | 81a4352 |
12 | 4a26b11 |
13 | 3002521 |
14 | 1cd1085 |
15 | 14120cd |
hex | dd08bd |
14485693 has 4 divisors (see below), whose sum is σ = 14506560. Its totient is φ = 14464828.
The previous prime is 14485687. The next prime is 14485721. The reversal of 14485693 is 39658441.
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, and also an emirpimes, since its reverse is a distinct semiprime: 39658441 = 257 ⋅154313.
It is a cyclic number.
It is not a de Polignac number, because 14485693 - 213 = 14477501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14485613) 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, 9355 + ... + 10792.
It is an arithmetic number, because the mean of its divisors is an integer number (3626640).
Almost surely, 214485693 is an apocalyptic number.
It is an amenable number.
14485693 is a deficient number, since it is larger than the sum of its proper divisors (20867).
14485693 is an equidigital number, since it uses as much as digits as its factorization.
14485693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20866.
The product of its digits is 103680, while the sum is 40.
The square root of 14485693 is about 3806.0074881692. The cubic root of 14485693 is about 243.7697202542.
Subtracting from 14485693 its sum of digits (40), we obtain a triangular number (14485653 = T5382).
The spelling of 14485693 in words is "fourteen million, four hundred eighty-five thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •