Base | Representation |
---|---|
bin | 1111100000001111110… |
… | …0000111111100000000 |
3 | 221110111200011110000000 |
4 | 3320003330013330000 |
5 | 13330443120041102 |
6 | 322210020000000 |
7 | 25146334125000 |
oct | 3700374077400 |
9 | 843450143000 |
10 | 266354065152 |
11 | a2a61a2047a |
12 | 43755530000 |
13 | 1c16a2c2716 |
14 | cc6a7cc000 |
15 | 6ddd94d01c |
hex | 3e03f07f00 |
266354065152 has 1152 divisors, whose sum is σ = 992239360000. Its totient is φ = 71108222976.
The previous prime is 266354065139. The next prime is 266354065163. The reversal of 266354065152 is 251560453662.
266354065152 is a `hidden beast` number, since 2 + 6 + 6 + 3 + 540 + 6 + 51 + 52 = 666.
It is a tau number, because it is divible by the number of its divisors (1152).
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 266354065098 and 266354065107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3648685788 + ... + 3648685860.
Almost surely, 2266354065152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 266354065152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (496119680000).
266354065152 is an abundant number, since it is smaller than the sum of its proper divisors (725885294848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266354065152 is an frugal number, since it uses more digits than its factorization.
266354065152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150 (or 104 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 45.
The spelling of 266354065152 in words is "two hundred sixty-six billion, three hundred fifty-four million, sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •