Base | Representation |
---|---|
bin | 110010101010… |
… | …0011010011000 |
3 | 1211222101200100 |
4 | 1211110122120 |
5 | 23244411102 |
6 | 2345135400 |
7 | 441520563 |
oct | 145243230 |
9 | 54871610 |
10 | 26560152 |
11 | 13aa1043 |
12 | 8a8a560 |
13 | 566c388 |
14 | 37554da |
15 | 24e9a1c |
hex | 1954698 |
26560152 has 48 divisors (see below), whose sum is σ = 72694440. Its totient is φ = 8759808.
The previous prime is 26560151. The next prime is 26560153. The reversal of 26560152 is 25106562.
26560152 is a `hidden beast` number, since 2 + 6 + 5 + 601 + 52 = 666.
It is an interprime number because it is at equal distance from previous prime (26560151) and next prime (26560153).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26560151) 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 11 ways as a sum of consecutive naturals, for example, 5083 + ... + 8885.
Almost surely, 226560152 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 26560152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36347220).
26560152 is an abundant number, since it is smaller than the sum of its proper divisors (46134288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26560152 is a wasteful number, since it uses less digits than its factorization.
26560152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3912 (or 3905 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 26560152 is about 5153.6542375289. The cubic root of 26560152 is about 298.3620061980.
The spelling of 26560152 in words is "twenty-six million, five hundred sixty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •