Base | Representation |
---|---|
bin | 110101011100… |
… | …100101001101 |
3 | 222100211001212 |
4 | 311130211031 |
5 | 12041320301 |
6 | 1220144205 |
7 | 230042345 |
oct | 65344515 |
9 | 28324055 |
10 | 14010701 |
11 | 79aa4a1 |
12 | 4838065 |
13 | 2b97273 |
14 | 1c09d25 |
15 | 136b4bb |
hex | d5c94d |
14010701 has 4 divisors (see below), whose sum is σ = 14030400. Its totient is φ = 13991004.
The previous prime is 14010697. The next prime is 14010719. The reversal of 14010701 is 10701041.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 14010701 - 22 = 14010697 is a prime.
It is a super-2 number, since 2×140107012 = 392599485022802, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14010721) 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, 8741 + ... + 10218.
It is an arithmetic number, because the mean of its divisors is an integer number (3507600).
Almost surely, 214010701 is an apocalyptic number.
It is an amenable number.
14010701 is a deficient number, since it is larger than the sum of its proper divisors (19699).
14010701 is an equidigital number, since it uses as much as digits as its factorization.
14010701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19698.
The product of its (nonzero) digits is 28, while the sum is 14.
The square root of 14010701 is about 3743.0870948991. The cubic root of 14010701 is about 241.0756177604.
Adding to 14010701 its reverse (10701041), we get a palindrome (24711742).
The spelling of 14010701 in words is "fourteen million, ten thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •