Base | Representation |
---|---|
bin | 11111110000100… |
… | …00000011100000 |
3 | 200120021201200012 |
4 | 33320100003200 |
5 | 1021144412224 |
6 | 42233544052 |
7 | 6413253143 |
oct | 1770200340 |
9 | 616251605 |
10 | 266404064 |
11 | 127418353 |
12 | 75275028 |
13 | 43267154 |
14 | 2754a05a |
15 | 185c480e |
hex | fe100e0 |
266404064 has 48 divisors (see below), whose sum is σ = 534386160. Its totient is φ = 130713600.
The previous prime is 266404043. The next prime is 266404067. The reversal of 266404064 is 460404662.
It is a super-2 number, since 2×2664040642 = 141942250631432192, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 266404064.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266404067) 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 in 7 ways as a sum of consecutive naturals, for example, 448952 + ... + 449544.
It is an arithmetic number, because the mean of its divisors is an integer number (11133045).
Almost surely, 2266404064 is an apocalyptic number.
It is an amenable number.
266404064 is an abundant number, since it is smaller than the sum of its proper divisors (267982096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266404064 is a wasteful number, since it uses less digits than its factorization.
266404064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843 (or 835 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
The square root of 266404064 is about 16321.8891063504. The cubic root of 266404064 is about 643.4482369388.
The spelling of 266404064 in words is "two hundred sixty-six million, four hundred four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •