Base | Representation |
---|---|
bin | 11111101111000… |
… | …01010000001001 |
3 | 200112220222201002 |
4 | 33313201100021 |
5 | 1021122243421 |
6 | 42225504345 |
7 | 6411524222 |
oct | 1767412011 |
9 | 615828632 |
10 | 266212361 |
11 | 1272a7318 |
12 | 751a20b5 |
13 | 431cab0c |
14 | 274da249 |
15 | 18587b0b |
hex | fde1409 |
266212361 has 2 divisors, whose sum is σ = 266212362. Its totient is φ = 266212360.
The previous prime is 266212321. The next prime is 266212369. The reversal of 266212361 is 163212662.
266212361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197571136 + 68641225 = 14056^2 + 8285^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-266212361 is a prime.
It is a super-2 number, since 2×2662123612 = 141738042298388642, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (266212369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133106180 + 133106181.
It is an arithmetic number, because the mean of its divisors is an integer number (133106181).
Almost surely, 2266212361 is an apocalyptic number.
It is an amenable number.
266212361 is a deficient number, since it is larger than the sum of its proper divisors (1).
266212361 is an equidigital number, since it uses as much as digits as its factorization.
266212361 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184, while the sum is 29.
The square root of 266212361 is about 16316.0154755994. The cubic root of 266212361 is about 643.2938592178.
It can be divided in two parts, 26621 and 2361, that added together give a palindrome (28982).
The spelling of 266212361 in words is "two hundred sixty-six million, two hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •