Base | Representation |
---|---|
bin | 11111110100100… |
… | …11011011110000 |
3 | 200121022001211212 |
4 | 33322103123300 |
5 | 1021314122232 |
6 | 42253255252 |
7 | 6420654056 |
oct | 1772233360 |
9 | 617261755 |
10 | 266942192 |
11 | 127755690 |
12 | 75494528 |
13 | 433c507a |
14 | 2764a1d6 |
15 | 1867deb2 |
hex | fe936f0 |
266942192 has 40 divisors (see below), whose sum is σ = 569842992. Its totient is φ = 120128000.
The previous prime is 266942183. The next prime is 266942197. The reversal of 266942192 is 291249662.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266942197) 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 in 7 ways as a sum of consecutive naturals, for example, 10268 + ... + 25284.
Almost surely, 2266942192 is an apocalyptic number.
266942192 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 266942192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (284921496).
266942192 is an abundant number, since it is smaller than the sum of its proper divisors (302900800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266942192 is a wasteful number, since it uses less digits than its factorization.
266942192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15137 (or 15131 counting only the distinct ones).
The product of its digits is 93312, while the sum is 41.
The square root of 266942192 is about 16338.3656465388. The cubic root of 266942192 is about 643.8811940864.
The spelling of 266942192 in words is "two hundred sixty-six million, nine hundred forty-two thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •