Base | Representation |
---|---|
bin | 110110011011… |
… | …101010000101 |
3 | 222211221110202 |
4 | 312123222011 |
5 | 12123102221 |
6 | 1225500245 |
7 | 232166522 |
oct | 66335205 |
9 | 28757422 |
10 | 14269061 |
11 | 8066614 |
12 | 4941685 |
13 | 2c57a41 |
14 | 1c76149 |
15 | 13bcd0b |
hex | d9ba85 |
14269061 has 2 divisors, whose sum is σ = 14269062. Its totient is φ = 14269060.
The previous prime is 14269051. The next prime is 14269063. The reversal of 14269061 is 16096241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14025025 + 244036 = 3745^2 + 494^2 .
It is a cyclic number.
It is not a de Polignac number, because 14269061 - 26 = 14268997 is a prime.
It is a super-2 number, since 2×142690612 = 407212203643442, which contains 22 as substring.
Together with 14269063, 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 (14269063) 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 as a sum of consecutive naturals, namely, 7134530 + 7134531.
It is an arithmetic number, because the mean of its divisors is an integer number (7134531).
Almost surely, 214269061 is an apocalyptic number.
It is an amenable number.
14269061 is a deficient number, since it is larger than the sum of its proper divisors (1).
14269061 is an equidigital number, since it uses as much as digits as its factorization.
14269061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 14269061 is about 3777.4410650598. The cubic root of 14269061 is about 242.5484283483.
It can be divided in two parts, 1426 and 9061, that multiplied together give a triangular number (12920986 = T5083).
The spelling of 14269061 in words is "fourteen million, two hundred sixty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •