Base | Representation |
---|---|
bin | 11111000111011… |
… | …11000101000000 |
3 | 200012011111111210 |
4 | 33203233011000 |
5 | 1013310313422 |
6 | 41522410120 |
7 | 6316454034 |
oct | 1743570500 |
9 | 605144453 |
10 | 261026112 |
11 | 124384866 |
12 | 73500940 |
13 | 42103329 |
14 | 2694a1c4 |
15 | 17db110c |
hex | f8ef140 |
261026112 has 56 divisors (see below), whose sum is σ = 699414400. Its totient is φ = 85902336.
The previous prime is 261026093. The next prime is 261026153. The reversal of 261026112 is 211620162.
261026112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2610261122 = 136269262291673088, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6564 + ... + 23772.
Almost surely, 2261026112 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 261026112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (349707200).
261026112 is an abundant number, since it is smaller than the sum of its proper divisors (438388288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261026112 is a wasteful number, since it uses less digits than its factorization.
261026112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17303 (or 17293 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 261026112 is about 16156.3025473033. The cubic root of 261026112 is about 639.0889641785.
Adding to 261026112 its reverse (211620162), we get a palindrome (472646274).
The spelling of 261026112 in words is "two hundred sixty-one million, twenty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •