Base | Representation |
---|---|
bin | 110011011011… |
… | …0010010000001 |
3 | 1212201202120111 |
4 | 1212312102001 |
5 | 23400223100 |
6 | 2401511321 |
7 | 445110400 |
oct | 146662201 |
9 | 55652514 |
10 | 26961025 |
11 | 14245243 |
12 | 9042541 |
13 | 577c990 |
14 | 381b637 |
15 | 25786ba |
hex | 19b6481 |
26961025 has 36 divisors (see below), whose sum is σ = 41906172. Its totient is φ = 17055360.
The previous prime is 26961023. The next prime is 26961059. The reversal of 26961025 is 52016962.
It can be written as a sum of positive squares in 6 ways, for example, as 4036081 + 22924944 = 2009^2 + 4788^2 .
It is not a de Polignac number, because 26961025 - 21 = 26961023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26961023) 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 35 ways as a sum of consecutive naturals, for example, 15079 + ... + 16771.
Almost surely, 226961025 is an apocalyptic number.
26961025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
26961025 is a deficient number, since it is larger than the sum of its proper divisors (14945147).
26961025 is a wasteful number, since it uses less digits than its factorization.
26961025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730 (or 1718 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 26961025 is about 5192.4006971727. The cubic root of 26961025 is about 299.8555786342.
Adding to 26961025 its reverse (52016962), we get a palindrome (78977987).
It can be divided in two parts, 2696 and 1025, that added together give a square (3721 = 612).
The spelling of 26961025 in words is "twenty-six million, nine hundred sixty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •