Base | Representation |
---|---|
bin | 11111101110011… |
… | …00001100110011 |
3 | 200112202121102101 |
4 | 33313030030303 |
5 | 1021112014011 |
6 | 42224001231 |
7 | 6411014635 |
oct | 1767141463 |
9 | 615677371 |
10 | 266126131 |
11 | 127248557 |
12 | 75160217 |
13 | 4319a7ab |
14 | 274b6a55 |
15 | 1856c2c1 |
hex | fdcc333 |
266126131 has 2 divisors, whose sum is σ = 266126132. Its totient is φ = 266126130.
The previous prime is 266126129. The next prime is 266126149. The reversal of 266126131 is 131621662.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 266126131 - 21 = 266126129 is a prime.
It is a super-2 number, since 2×2661261312 = 141646235202058322, which contains 22 as substring.
Together with 266126129, it forms a pair of twin primes.
It is a nialpdrome in base 16.
It is a self number, because there is not a number n which added to its sum of digits gives 266126131.
It is not a weakly prime, because it can be changed into another prime (266126191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133063065 + 133063066.
It is an arithmetic number, because the mean of its divisors is an integer number (133063066).
Almost surely, 2266126131 is an apocalyptic number.
266126131 is a deficient number, since it is larger than the sum of its proper divisors (1).
266126131 is an equidigital number, since it uses as much as digits as its factorization.
266126131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 28.
The square root of 266126131 is about 16313.3727659243. The cubic root of 266126131 is about 643.2243943494.
Adding to 266126131 its reverse (131621662), we get a palindrome (397747793).
The spelling of 266126131 in words is "two hundred sixty-six million, one hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •