Base | Representation |
---|---|
bin | 111000110010… |
… | …010100110101 |
3 | 1001000022000122 |
4 | 320302110311 |
5 | 12302324242 |
6 | 1251021325 |
7 | 240346664 |
oct | 70622465 |
9 | 31008018 |
10 | 14886197 |
11 | 8448247 |
12 | 4b9a845 |
13 | 3112901 |
14 | 1d96ddb |
15 | 1490ad2 |
hex | e32535 |
14886197 has 2 divisors, whose sum is σ = 14886198. Its totient is φ = 14886196.
The previous prime is 14886181. The next prime is 14886199. The reversal of 14886197 is 79168841.
14886197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13060996 + 1825201 = 3614^2 + 1351^2 .
It is an emirp because it is prime and its reverse (79168841) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14886197 - 24 = 14886181 is a prime.
It is a super-2 number, since 2×148861972 = 443197722245618, which contains 22 as substring.
Together with 14886199, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14886199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7443098 + 7443099.
It is an arithmetic number, because the mean of its divisors is an integer number (7443099).
Almost surely, 214886197 is an apocalyptic number.
It is an amenable number.
14886197 is a deficient number, since it is larger than the sum of its proper divisors (1).
14886197 is an equidigital number, since it uses as much as digits as its factorization.
14886197 is an evil number, because the sum of its binary digits is even.
The product of its digits is 96768, while the sum is 44.
The square root of 14886197 is about 3858.2634694899. The cubic root of 14886197 is about 245.9959293838.
The spelling of 14886197 in words is "fourteen million, eight hundred eighty-six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •