Base | Representation |
---|---|
bin | 1111011111000111111… |
… | …0010111001110111000 |
3 | 221102201200000120212201 |
4 | 3313301332113032320 |
5 | 13324333440142300 |
6 | 322120051515544 |
7 | 25136014213123 |
oct | 3676176271670 |
9 | 842650016781 |
10 | 266052662200 |
11 | a2917878a26 |
12 | 436905b8bb4 |
13 | 1c11ca23190 |
14 | cc3c7713ba |
15 | 6dc226366a |
hex | 3df1f973b8 |
266052662200 has 192 divisors, whose sum is σ = 706144491360. Its totient is φ = 92350955520.
The previous prime is 266052662137. The next prime is 266052662209. The reversal of 266052662200 is 2266250662.
It is a self number, because there is not a number n which added to its sum of digits gives 266052662200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266052662209) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 45655687 + ... + 45661513.
Almost surely, 2266052662200 is an apocalyptic number.
266052662200 is a gapful number since it is divisible by the number (20) 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 266052662200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (353072245680).
266052662200 is an abundant number, since it is smaller than the sum of its proper divisors (440091829160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266052662200 is a wasteful number, since it uses less digits than its factorization.
266052662200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6906 (or 6897 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 266052662200 in words is "two hundred sixty-six billion, fifty-two million, six hundred sixty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •