Base | Representation |
---|---|
bin | 111100100000011011011010… |
… | …000111110101010101100110 |
3 | 1021220012222122002021211020210 |
4 | 330200123122013311111212 |
5 | 234334431311230242014 |
6 | 2341545452323040250 |
7 | 110023621452550155 |
oct | 7440333207652546 |
9 | 1256188562254223 |
10 | 266111243212134 |
11 | 77878165318661 |
12 | 25a1a184b10086 |
13 | b56424b10b128 |
14 | 499dbd24ab59c |
15 | 20b726dde6859 |
hex | f206da1f5566 |
266111243212134 has 8 divisors (see below), whose sum is σ = 532222486424280. Its totient is φ = 88703747737376.
The previous prime is 266111243212121. The next prime is 266111243212151. The reversal of 266111243212134 is 431212342111662.
It is a sphenic number, since it is the product of 3 distinct primes.
266111243212134 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 266111243212092 and 266111243212101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22175936934339 + ... + 22175936934350.
It is an arithmetic number, because the mean of its divisors is an integer number (66527810803035).
Almost surely, 2266111243212134 is an apocalyptic number.
266111243212134 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266111243212134 is a wasteful number, since it uses less digits than its factorization.
266111243212134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44351873868694.
The product of its digits is 82944, while the sum is 39.
Adding to 266111243212134 its reverse (431212342111662), we get a palindrome (697323585323796).
The spelling of 266111243212134 in words is "two hundred sixty-six trillion, one hundred eleven billion, two hundred forty-three million, two hundred twelve thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •