Base | Representation |
---|---|
bin | 110101011110… |
… | …000010101011 |
3 | 222101010021102 |
4 | 311132002223 |
5 | 12042013213 |
6 | 1220232015 |
7 | 230065652 |
oct | 65360253 |
9 | 28333242 |
10 | 14016683 |
11 | 7a03a3a |
12 | 483b60b |
13 | 2b99bc5 |
14 | 1c0c199 |
15 | 136d158 |
hex | d5e0ab |
14016683 has 4 divisors (see below), whose sum is σ = 14626128. Its totient is φ = 13407240.
The previous prime is 14016677. The next prime is 14016697. The reversal of 14016683 is 38661041.
14016683 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 38661041 = 37 ⋅1044893.
It is a cyclic number.
It is not a de Polignac number, because 14016683 - 28 = 14016427 is a prime.
It is a super-4 number, since 4×140166834 (a number of 30 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14016283) 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, 304688 + ... + 304733.
It is an arithmetic number, because the mean of its divisors is an integer number (3656532).
Almost surely, 214016683 is an apocalyptic number.
14016683 is a deficient number, since it is larger than the sum of its proper divisors (609445).
14016683 is an equidigital number, since it uses as much as digits as its factorization.
14016683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609444.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 14016683 is about 3743.8860826686. The cubic root of 14016683 is about 241.1099227094.
The spelling of 14016683 in words is "fourteen million, sixteen thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •