Base | Representation |
---|---|
bin | 1111100001110101110… |
… | …0011010101110000000 |
3 | 221111121111022210212122 |
4 | 3320131130122232000 |
5 | 13332332140223323 |
6 | 322320303143412 |
7 | 25163051153006 |
oct | 3703534325600 |
9 | 844544283778 |
10 | 266781961088 |
11 | a3161509a85 |
12 | 438548a4b68 |
13 | 1c207b50396 |
14 | ccab574a76 |
15 | 6e162c1ec8 |
hex | 3e1d71ab80 |
266781961088 has 32 divisors (see below), whose sum is σ = 531673725000. Its totient is φ = 133342281216.
The previous prime is 266781961087. The next prime is 266781961097. The reversal of 266781961088 is 880169187662.
266781961088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×2667819610882 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 266781961088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266781961087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27218 + ... + 730961.
Almost surely, 2266781961088 is an apocalyptic number.
It is an amenable number.
266781961088 is a deficient number, since it is larger than the sum of its proper divisors (264891763912).
266781961088 is an equidigital number, since it uses as much as digits as its factorization.
266781961088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760942 (or 760930 counting only the distinct ones).
The product of its (nonzero) digits is 13934592, while the sum is 62.
The spelling of 266781961088 in words is "two hundred sixty-six billion, seven hundred eighty-one million, nine hundred sixty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •