Base | Representation |
---|---|
bin | 110010000101… |
… | …1001100101111 |
3 | 1211102011022122 |
4 | 1210023030233 |
5 | 23210312041 |
6 | 2334503155 |
7 | 436131362 |
oct | 144131457 |
9 | 54364278 |
10 | 26260271 |
11 | 13906804 |
12 | 8964abb |
13 | 5595a2b |
14 | 36b80d9 |
15 | 248ac4b |
hex | 190b32f |
26260271 has 4 divisors (see below), whose sum is σ = 26271000. Its totient is φ = 26249544.
The previous prime is 26260253. The next prime is 26260277. The reversal of 26260271 is 17206262.
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, and also an emirpimes, since its reverse is a distinct semiprime: 17206262 = 2 ⋅8603131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26260271 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26260271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26260277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 305 + ... + 7253.
It is an arithmetic number, because the mean of its divisors is an integer number (6567750).
Almost surely, 226260271 is an apocalyptic number.
26260271 is a deficient number, since it is larger than the sum of its proper divisors (10729).
26260271 is an equidigital number, since it uses as much as digits as its factorization.
26260271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10728.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 26260271 is about 5124.4776319153. The cubic root of 26260271 is about 297.2348545027.
The spelling of 26260271 in words is "twenty-six million, two hundred sixty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •