Base | Representation |
---|---|
bin | 110010110000… |
… | …1100101100001 |
3 | 1212002010200220 |
4 | 1211201211201 |
5 | 23303122423 |
6 | 2350233253 |
7 | 442134111 |
oct | 145414541 |
9 | 55063626 |
10 | 26614113 |
11 | 14028639 |
12 | 8ab5829 |
13 | 568aac6 |
14 | 376b041 |
15 | 250a9e3 |
hex | 1961961 |
26614113 has 4 divisors (see below), whose sum is σ = 35485488. Its totient is φ = 17742740.
The previous prime is 26614103. The next prime is 26614127. The reversal of 26614113 is 31141662.
26614113 is nontrivially palindromic in base 8.
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.
It is a cyclic number.
It is not a de Polignac number, because 26614113 - 220 = 25565537 is a prime.
It is a super-2 number, since 2×266141132 = 1416622021553538, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (26614103) 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, 4435683 + ... + 4435688.
It is an arithmetic number, because the mean of its divisors is an integer number (8871372).
Almost surely, 226614113 is an apocalyptic number.
It is an amenable number.
26614113 is a deficient number, since it is larger than the sum of its proper divisors (8871375).
26614113 is an equidigital number, since it uses as much as digits as its factorization.
26614113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8871374.
The product of its digits is 864, while the sum is 24.
The square root of 26614113 is about 5158.8867985254. The cubic root of 26614113 is about 298.5639254912.
Adding to 26614113 its reverse (31141662), we get a palindrome (57755775).
The spelling of 26614113 in words is "twenty-six million, six hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •