Base | Representation |
---|---|
bin | 110110011010… |
… | …110110100001 |
3 | 222211202221112 |
4 | 312122312201 |
5 | 12123001021 |
6 | 1225433105 |
7 | 232154066 |
oct | 66326641 |
9 | 28752845 |
10 | 14265761 |
11 | 8064094 |
12 | 493b795 |
13 | 2c563a3 |
14 | 1c74c6d |
15 | 13bbd5b |
hex | d9ada1 |
14265761 has 2 divisors, whose sum is σ = 14265762. Its totient is φ = 14265760.
The previous prime is 14265749. The next prime is 14265793. The reversal of 14265761 is 16756241.
It is an a-pointer prime, because the next prime (14265793) can be obtained adding 14265761 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13184161 + 1081600 = 3631^2 + 1040^2 .
It is an emirp because it is prime and its reverse (16756241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14265761 - 26 = 14265697 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14265701) 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, 7132880 + 7132881.
It is an arithmetic number, because the mean of its divisors is an integer number (7132881).
Almost surely, 214265761 is an apocalyptic number.
It is an amenable number.
14265761 is a deficient number, since it is larger than the sum of its proper divisors (1).
14265761 is an equidigital number, since it uses as much as digits as its factorization.
14265761 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10080, while the sum is 32.
The square root of 14265761 is about 3777.0042361639. The cubic root of 14265761 is about 242.5297288809.
Subtracting from 14265761 its sum of digits (32), we obtain a square (14265729 = 37772).
The spelling of 14265761 in words is "fourteen million, two hundred sixty-five thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •