Base | Representation |
---|---|
bin | 110101011011… |
… | …100011000111 |
3 | 222100121021012 |
4 | 311123203013 |
5 | 12041201341 |
6 | 1220112435 |
7 | 230024123 |
oct | 65334307 |
9 | 28317235 |
10 | 14006471 |
11 | 79a72a6 |
12 | 483571b |
13 | 2b9536b |
14 | 1c08583 |
15 | 136a0eb |
hex | d5b8c7 |
14006471 has 4 divisors (see below), whose sum is σ = 14615472. Its totient is φ = 13397472.
The previous prime is 14006467. The next prime is 14006483. The reversal of 14006471 is 17460041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17460041 = 37 ⋅471893.
It is a cyclic number.
It is not a de Polignac number, because 14006471 - 22 = 14006467 is a prime.
It is a super-3 number, since 3×140064713 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 608977 = 14006471 / (1 + 4 + 0 + 0 + 6 + 4 + 7 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14006411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 304466 + ... + 304511.
It is an arithmetic number, because the mean of its divisors is an integer number (3653868).
Almost surely, 214006471 is an apocalyptic number.
14006471 is a deficient number, since it is larger than the sum of its proper divisors (609001).
14006471 is an equidigital number, since it uses as much as digits as its factorization.
14006471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 609000.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 14006471 is about 3742.5220106233. The cubic root of 14006471 is about 241.0513541040.
The spelling of 14006471 in words is "fourteen million, six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •