Base | Representation |
---|---|
bin | 110101110100… |
… | …000001001111 |
3 | 222112200202111 |
4 | 311310001033 |
5 | 12102403303 |
6 | 1222204451 |
7 | 230622262 |
oct | 65640117 |
9 | 28480674 |
10 | 14106703 |
11 | 7a65636 |
12 | 4883727 |
13 | 2bcbb80 |
14 | 1c32cd9 |
15 | 1389b6d |
hex | d7404f |
14106703 has 4 divisors (see below), whose sum is σ = 15191848. Its totient is φ = 13021560.
The previous prime is 14106691. The next prime is 14106713. The reversal of 14106703 is 30760141.
14106703 is digitally balanced in base 2, 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: 30760141 = 3929 ⋅7829.
It is a cyclic number.
It is not a de Polignac number, because 14106703 - 221 = 12009551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14106713) 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, 542553 + ... + 542578.
It is an arithmetic number, because the mean of its divisors is an integer number (3797962).
Almost surely, 214106703 is an apocalyptic number.
14106703 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14106703 is a deficient number, since it is larger than the sum of its proper divisors (1085145).
14106703 is a wasteful number, since it uses less digits than its factorization.
14106703 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085144.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 14106703 is about 3755.8891091192. The cubic root of 14106703 is about 241.6249854922.
Adding to 14106703 its reverse (30760141), we get a palindrome (44866844).
The spelling of 14106703 in words is "fourteen million, one hundred six thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •