Base | Representation |
---|---|
bin | 110011001000… |
… | …0010011101001 |
3 | 1212102212012121 |
4 | 1212100103221 |
5 | 23330233411 |
6 | 2354311241 |
7 | 443562043 |
oct | 146202351 |
9 | 55385177 |
10 | 26805481 |
11 | 1414939a |
12 | 8b88521 |
13 | 5726c41 |
14 | 37baa93 |
15 | 2547571 |
hex | 19904e9 |
26805481 has 4 divisors (see below), whose sum is σ = 28382292. Its totient is φ = 25228672.
The previous prime is 26805479. The next prime is 26805497. The reversal of 26805481 is 18450862.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17139600 + 9665881 = 4140^2 + 3109^2 .
It is a cyclic number.
It is not a de Polignac number, because 26805481 - 21 = 26805479 is a prime.
It is a super-3 number, since 3×268054813 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26805461) 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 3 ways as a sum of consecutive naturals, for example, 788380 + ... + 788413.
It is an arithmetic number, because the mean of its divisors is an integer number (7095573).
Almost surely, 226805481 is an apocalyptic number.
It is an amenable number.
26805481 is a deficient number, since it is larger than the sum of its proper divisors (1576811).
26805481 is a wasteful number, since it uses less digits than its factorization.
26805481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1576810.
The product of its (nonzero) digits is 15360, while the sum is 34.
The square root of 26805481 is about 5177.4009889133. The cubic root of 26805481 is about 299.2778221849.
The spelling of 26805481 in words is "twenty-six million, eight hundred five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •