Base | Representation |
---|---|
bin | 110010110111… |
… | …0000001100001 |
3 | 1212011201120201 |
4 | 1211232001201 |
5 | 23311240212 |
6 | 2351305201 |
7 | 442435456 |
oct | 145560141 |
9 | 55151521 |
10 | 26665057 |
11 | 14062941 |
12 | 8b1b201 |
13 | 56a8053 |
14 | 378182d |
15 | 251ab57 |
hex | 196e061 |
26665057 has 4 divisors (see below), whose sum is σ = 26824896. Its totient is φ = 26505220.
The previous prime is 26665043. The next prime is 26665081. The reversal of 26665057 is 75056662.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 75056662 = 2 ⋅37528331.
It is a cyclic number.
It is not a de Polignac number, because 26665057 - 215 = 26632289 is a prime.
It is a super-2 number, since 2×266650572 = 1422050529626498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26665097) 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, 79669 + ... + 80002.
It is an arithmetic number, because the mean of its divisors is an integer number (6706224).
Almost surely, 226665057 is an apocalyptic number.
It is an amenable number.
26665057 is a deficient number, since it is larger than the sum of its proper divisors (159839).
26665057 is a wasteful number, since it uses less digits than its factorization.
26665057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159838.
The product of its (nonzero) digits is 75600, while the sum is 37.
The square root of 26665057 is about 5163.8219372864. The cubic root of 26665057 is about 298.7543050097.
The spelling of 26665057 in words is "twenty-six million, six hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •