Base | Representation |
---|---|
bin | 110101101010… |
… | …111111000101 |
3 | 222110211000001 |
4 | 311222333011 |
5 | 12100212301 |
6 | 1221321301 |
7 | 230406352 |
oct | 65527705 |
9 | 28424001 |
10 | 14069701 |
11 | 7a3a858 |
12 | 4866231 |
13 | 2bb8089 |
14 | 1c23629 |
15 | 137dc01 |
hex | d6afc5 |
14069701 has 4 divisors (see below), whose sum is σ = 14077804. Its totient is φ = 14061600.
The previous prime is 14069689. The next prime is 14069707. The reversal of 14069701 is 10796041.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 10796041 = 47 ⋅229703.
It can be written as a sum of positive squares in 2 ways, for example, as 1324801 + 12744900 = 1151^2 + 3570^2 .
It is a cyclic number.
It is not a de Polignac number, because 14069701 - 215 = 14036933 is a prime.
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 14069701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14069707) 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, 270 + ... + 5311.
It is an arithmetic number, because the mean of its divisors is an integer number (3519451).
Almost surely, 214069701 is an apocalyptic number.
It is an amenable number.
14069701 is a deficient number, since it is larger than the sum of its proper divisors (8103).
14069701 is an equidigital number, since it uses as much as digits as its factorization.
14069701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8102.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 14069701 is about 3750.9600104507. The cubic root of 14069701 is about 241.4135390561.
The spelling of 14069701 in words is "fourteen million, sixty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •