Base | Representation |
---|---|
bin | 110110011011… |
… | …000110110001 |
3 | 222211211101001 |
4 | 312123012301 |
5 | 12123014201 |
6 | 1225442001 |
7 | 232160113 |
oct | 66330661 |
9 | 28754331 |
10 | 14266801 |
11 | 806494a |
12 | 4940301 |
13 | 2c569c3 |
14 | 1c753b3 |
15 | 13bc301 |
hex | d9b1b1 |
14266801 has 2 divisors, whose sum is σ = 14266802. Its totient is φ = 14266800.
The previous prime is 14266783. The next prime is 14266807. The reversal of 14266801 is 10866241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12967201 + 1299600 = 3601^2 + 1140^2 .
It is a cyclic number.
It is not a de Polignac number, because 14266801 - 213 = 14258609 is a prime.
It is a super-2 number, since 2×142668012 = 407083221547202, 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 14266801.
It is not a weakly prime, because it can be changed into another prime (14266807) 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, 7133400 + 7133401.
It is an arithmetic number, because the mean of its divisors is an integer number (7133401).
Almost surely, 214266801 is an apocalyptic number.
It is an amenable number.
14266801 is a deficient number, since it is larger than the sum of its proper divisors (1).
14266801 is an equidigital number, since it uses as much as digits as its factorization.
14266801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 14266801 is about 3777.1419089041. The cubic root of 14266801 is about 242.5356223576.
It can be divided in two parts, 14 and 266801, that added together give a triangular number (266815 = T730).
The spelling of 14266801 in words is "fourteen million, two hundred sixty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •