Base | Representation |
---|---|
bin | 110111110110… |
… | …011110101101 |
3 | 1000112211202211 |
4 | 313312132231 |
5 | 12222003234 |
6 | 1241450421 |
7 | 235306222 |
oct | 67663655 |
9 | 30484684 |
10 | 14641069 |
11 | 82a0063 |
12 | 4aa0a11 |
13 | 3058171 |
14 | 1d31949 |
15 | 1443164 |
hex | df67ad |
14641069 has 2 divisors, whose sum is σ = 14641070. Its totient is φ = 14641068.
The previous prime is 14641051. The next prime is 14641073. The reversal of 14641069 is 96014641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10692900 + 3948169 = 3270^2 + 1987^2 .
It is a cyclic number.
It is not a de Polignac number, because 14641069 - 223 = 6252461 is a prime.
It is a super-2 number, since 2×146410692 = 428721802925522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14641069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14641049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7320534 + 7320535.
It is an arithmetic number, because the mean of its divisors is an integer number (7320535).
Almost surely, 214641069 is an apocalyptic number.
It is an amenable number.
14641069 is a deficient number, since it is larger than the sum of its proper divisors (1).
14641069 is an equidigital number, since it uses as much as digits as its factorization.
14641069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 14641069 is about 3826.3649852046. The cubic root of 14641069 is about 244.6381942711.
The spelling of 14641069 in words is "fourteen million, six hundred forty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •