Base | Representation |
---|---|
bin | 110001101100… |
… | …1001001010100 |
3 | 1211000202002100 |
4 | 1203121021110 |
5 | 23132232002 |
6 | 2330242100 |
7 | 434315556 |
oct | 143311124 |
9 | 54022070 |
10 | 26055252 |
11 | 13786773 |
12 | 8886330 |
13 | 5523612 |
14 | 36634d6 |
15 | 244a11c |
hex | 18d9254 |
26055252 has 72 divisors (see below), whose sum is σ = 69934592. Its totient is φ = 8164800.
The previous prime is 26055247. The next prime is 26055257. The reversal of 26055252 is 25255062.
26055252 is a `hidden beast` number, since 2 + 60 + 552 + 52 = 666.
It is an interprime number because it is at equal distance from previous prime (26055247) and next prime (26055257).
It is a nialpdrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26055257) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 40977 + ... + 41607.
Almost surely, 226055252 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 26055252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34967296).
26055252 is an abundant number, since it is smaller than the sum of its proper divisors (43879340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26055252 is a wasteful number, since it uses less digits than its factorization.
26055252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709 (or 704 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 26055252 is about 5104.4345426306. The cubic root of 26055252 is about 296.4593094338.
The spelling of 26055252 in words is "twenty-six million, fifty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •