Base | Representation |
---|---|
bin | 110001110000… |
… | …0011111000001 |
3 | 1211002021022201 |
4 | 1203200133001 |
5 | 23134212223 |
6 | 2331033201 |
7 | 434502322 |
oct | 143403701 |
9 | 54067281 |
10 | 26085313 |
11 | 137a7311 |
12 | 889b801 |
13 | 55341c7 |
14 | 3670449 |
15 | 2453ead |
hex | 18e07c1 |
26085313 has 4 divisors (see below), whose sum is σ = 26096580. Its totient is φ = 26074048.
The previous prime is 26085223. The next prime is 26085317. The reversal of 26085313 is 31358062.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 19820304 + 6265009 = 4452^2 + 2503^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26085313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26085317) 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, 748 + ... + 7261.
It is an arithmetic number, because the mean of its divisors is an integer number (6524145).
Almost surely, 226085313 is an apocalyptic number.
It is an amenable number.
26085313 is a deficient number, since it is larger than the sum of its proper divisors (11267).
26085313 is an equidigital number, since it uses as much as digits as its factorization.
26085313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11266.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 26085313 is about 5107.3782902777. The cubic root of 26085313 is about 296.5732779876.
It can be divided in two parts, 2608 and 5313, that added together give a square (7921 = 892).
The spelling of 26085313 in words is "twenty-six million, eighty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •