Base | Representation |
---|---|
bin | 110010111001… |
… | …1000111111001 |
3 | 1212012210020100 |
4 | 1211303013321 |
5 | 23312422240 |
6 | 2351550013 |
7 | 442553406 |
oct | 145630771 |
9 | 55183210 |
10 | 26685945 |
11 | 14077600 |
12 | 8b2b309 |
13 | 56b4700 |
14 | 37892ad |
15 | 2521e30 |
hex | 19731f9 |
26685945 has 108 divisors (see below), whose sum is σ = 56953260. Its totient is φ = 11531520.
The previous prime is 26685913. The next prime is 26685949. The reversal of 26685945 is 54958662.
26685945 = 952 + 962 + ... + 4322.
It can be written as a sum of positive squares in 6 ways, for example, as 5035536 + 21650409 = 2244^2 + 4653^2 .
It is not a de Polignac number, because 26685945 - 25 = 26685913 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 26685945.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26685949) by changing a digit.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 920191 + ... + 920219.
It is an arithmetic number, because the mean of its divisors is an integer number (527345).
Almost surely, 226685945 is an apocalyptic number.
It is an amenable number.
26685945 is an abundant number, since it is smaller than the sum of its proper divisors (30267315).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26685945 is a wasteful number, since it uses less digits than its factorization.
26685945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88 (or 61 counting only the distinct ones).
The product of its digits is 518400, while the sum is 45.
The square root of 26685945 is about 5165.8440743019. The cubic root of 26685945 is about 298.8322941069.
The spelling of 26685945 in words is "twenty-six million, six hundred eighty-five thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •