Base | Representation |
---|---|
bin | 110010000101… |
… | …1011100010100 |
3 | 1211102012200120 |
4 | 1210023130110 |
5 | 23210330033 |
6 | 2334511540 |
7 | 436134315 |
oct | 144133424 |
9 | 54365616 |
10 | 26261268 |
11 | 13907530 |
12 | 89655b0 |
13 | 5596317 |
14 | 36b860c |
15 | 248b1b3 |
hex | 190b714 |
26261268 has 96 divisors (see below), whose sum is σ = 72522240. Its totient is φ = 7309440.
The previous prime is 26261201. The next prime is 26261273. The reversal of 26261268 is 86216262.
It is a super-3 number, since 3×262612683 (a number of 23 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92655 + ... + 92937.
It is an arithmetic number, because the mean of its divisors is an integer number (755440).
Almost surely, 226261268 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 26261268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36261120).
26261268 is an abundant number, since it is smaller than the sum of its proper divisors (46260972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26261268 is a wasteful number, since it uses less digits than its factorization.
26261268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357 (or 355 counting only the distinct ones).
The product of its digits is 13824, while the sum is 33.
The square root of 26261268 is about 5124.5749091998. The cubic root of 26261268 is about 297.2386160709.
The spelling of 26261268 in words is "twenty-six million, two hundred sixty-one thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •