Base | Representation |
---|---|
bin | 110101110011… |
… | …001010101101 |
3 | 222112111222020 |
4 | 311303022231 |
5 | 12102300323 |
6 | 1222140353 |
7 | 230606145 |
oct | 65631255 |
9 | 28474866 |
10 | 14103213 |
11 | 7a62a53 |
12 | 48816b9 |
13 | 2bca3c7 |
14 | 1c31925 |
15 | 1388ae3 |
hex | d732ad |
14103213 has 4 divisors (see below), whose sum is σ = 18804288. Its totient is φ = 9402140.
The previous prime is 14103211. The next prime is 14103239. The reversal of 14103213 is 31230141.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31230141 = 3 ⋅10410047.
It is a cyclic number.
It is not a de Polignac number, because 14103213 - 21 = 14103211 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14103192 and 14103201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14103211) 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, 2350533 + ... + 2350538.
It is an arithmetic number, because the mean of its divisors is an integer number (4701072).
Almost surely, 214103213 is an apocalyptic number.
It is an amenable number.
14103213 is a deficient number, since it is larger than the sum of its proper divisors (4701075).
14103213 is an equidigital number, since it uses as much as digits as its factorization.
14103213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4701074.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 14103213 is about 3755.4244766737. The cubic root of 14103213 is about 241.6050578320.
Adding to 14103213 its reverse (31230141), we get a palindrome (45333354).
The spelling of 14103213 in words is "fourteen million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •