Base | Representation |
---|---|
bin | 11111110100001… |
… | …10000000000001 |
3 | 200121012021100222 |
4 | 33322012000001 |
5 | 1021310342134 |
6 | 42252152425 |
7 | 6420334463 |
oct | 1772060001 |
9 | 617167328 |
10 | 266887169 |
11 | 12771830a |
12 | 75468715 |
13 | 433a6003 |
14 | 27634133 |
15 | 1866ca2e |
hex | fe86001 |
266887169 has 2 divisors, whose sum is σ = 266887170. Its totient is φ = 266887168.
The previous prime is 266887157. The next prime is 266887207. The reversal of 266887169 is 961788662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 239847169 + 27040000 = 15487^2 + 5200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-266887169 is a prime.
It is a super-2 number, since 2×2668871692 = 142457521953669122, 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 266887169.
It is not a weakly prime, because it can be changed into another prime (266887769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133443584 + 133443585.
It is an arithmetic number, because the mean of its divisors is an integer number (133443585).
Almost surely, 2266887169 is an apocalyptic number.
It is an amenable number.
266887169 is a deficient number, since it is larger than the sum of its proper divisors (1).
266887169 is an equidigital number, since it uses as much as digits as its factorization.
266887169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1741824, while the sum is 53.
The square root of 266887169 is about 16336.6817010065. The cubic root of 266887169 is about 643.8369514120.
The spelling of 266887169 in words is "two hundred sixty-six million, eight hundred eighty-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •