Base | Representation |
---|---|
bin | 11111110000011… |
… | …11110001000001 |
3 | 200120021200001101 |
4 | 33320033301001 |
5 | 1021144343011 |
6 | 42233534401 |
7 | 6413246533 |
oct | 1770176101 |
9 | 616250041 |
10 | 266402881 |
11 | 127417478 |
12 | 75274401 |
13 | 43266754 |
14 | 27549853 |
15 | 185c42c1 |
hex | fe0fc41 |
266402881 has 4 divisors (see below), whose sum is σ = 267193732. Its totient is φ = 265612032.
The previous prime is 266402861. The next prime is 266402959. The reversal of 266402881 is 188204662.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38241856 + 228161025 = 6184^2 + 15105^2 .
It is a cyclic number.
It is not a de Polignac number, because 266402881 - 27 = 266402753 is a prime.
It is a super-2 number, since 2×2664028812 = 141940990010200322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 266402881.
It is not an unprimeable number, because it can be changed into a prime (266402821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 394920 + ... + 395593.
It is an arithmetic number, because the mean of its divisors is an integer number (66798433).
Almost surely, 2266402881 is an apocalyptic number.
It is an amenable number.
266402881 is a deficient number, since it is larger than the sum of its proper divisors (790851).
266402881 is an equidigital number, since it uses as much as digits as its factorization.
266402881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790850.
The product of its (nonzero) digits is 36864, while the sum is 37.
The square root of 266402881 is about 16321.8528666325. The cubic root of 266402881 is about 643.4472845004.
The spelling of 266402881 in words is "two hundred sixty-six million, four hundred two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •