Base | Representation |
---|---|
bin | 110101101001… |
… | …110100100011 |
3 | 222110120110101 |
4 | 311221310203 |
5 | 12100034211 |
6 | 1221243231 |
7 | 230356426 |
oct | 65516443 |
9 | 28416411 |
10 | 14064931 |
11 | 7a37211 |
12 | 4863517 |
13 | 2bb5b5a |
14 | 1c219bd |
15 | 137c5c1 |
hex | d69d23 |
14064931 has 4 divisors (see below), whose sum is σ = 14234472. Its totient is φ = 13895392.
The previous prime is 14064901. The next prime is 14064949. The reversal of 14064931 is 13946041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13946041 = 727 ⋅19183.
It is a cyclic number.
It is not a de Polignac number, because 14064931 - 27 = 14064803 is a prime.
It is a super-2 number, since 2×140649312 = 395644568069522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14064931.
It is not an unprimeable number, because it can be changed into a prime (14064901) 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, 84646 + ... + 84811.
It is an arithmetic number, because the mean of its divisors is an integer number (3558618).
Almost surely, 214064931 is an apocalyptic number.
14064931 is a deficient number, since it is larger than the sum of its proper divisors (169541).
14064931 is an equidigital number, since it uses as much as digits as its factorization.
14064931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169540.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 14064931 is about 3750.3241193262. The cubic root of 14064931 is about 241.3862541186.
The spelling of 14064931 in words is "fourteen million, sixty-four thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •