Base | Representation |
---|---|
bin | 110001101101… |
… | …0100000111101 |
3 | 1211001000210002 |
4 | 1203122200331 |
5 | 23132421421 |
6 | 2330324045 |
7 | 434341121 |
oct | 143324075 |
9 | 54030702 |
10 | 26060861 |
11 | 1378aa02 |
12 | 8889625 |
13 | 5526038 |
14 | 3665581 |
15 | 244bb0b |
hex | 18da83d |
26060861 has 4 divisors (see below), whose sum is σ = 26091324. Its totient is φ = 26030400.
The previous prime is 26060857. The next prime is 26060869. The reversal of 26060861 is 16806062.
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 11764900 + 14295961 = 3430^2 + 3781^2 .
It is a cyclic number.
It is not a de Polignac number, because 26060861 - 22 = 26060857 is a prime.
It is a super-2 number, since 2×260608612 = 1358336952122642, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26060869) 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, 13910 + ... + 15671.
It is an arithmetic number, because the mean of its divisors is an integer number (6522831).
Almost surely, 226060861 is an apocalyptic number.
It is an amenable number.
26060861 is a deficient number, since it is larger than the sum of its proper divisors (30463).
26060861 is an equidigital number, since it uses as much as digits as its factorization.
26060861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30462.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 26060861 is about 5104.9839372911. The cubic root of 26060861 is about 296.4805811651.
The spelling of 26060861 in words is "twenty-six million, sixty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •