Base | Representation |
---|---|
bin | 110001101111… |
… | …1011101001111 |
3 | 1211002001112210 |
4 | 1203133131033 |
5 | 23134043403 |
6 | 2331001503 |
7 | 434454126 |
oct | 143373517 |
9 | 54061483 |
10 | 26081103 |
11 | 137a4134 |
12 | 8899293 |
13 | 5532309 |
14 | 366cabd |
15 | 2452b03 |
hex | 18df74f |
26081103 has 16 divisors (see below), whose sum is σ = 36412416. Its totient is φ = 16573920.
The previous prime is 26081093. The next prime is 26081113. The reversal of 26081103 is 30118062.
It is an interprime number because it is at equal distance from previous prime (26081093) and next prime (26081113).
It is not a de Polignac number, because 26081103 - 29 = 26080591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 26081103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26081113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29301 + ... + 30177.
It is an arithmetic number, because the mean of its divisors is an integer number (2275776).
Almost surely, 226081103 is an apocalyptic number.
26081103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
26081103 is a deficient number, since it is larger than the sum of its proper divisors (10331313).
26081103 is a wasteful number, since it uses less digits than its factorization.
26081103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 26081103 is about 5106.9661248142. The cubic root of 26081103 is about 296.5573221292.
Adding to 26081103 its reverse (30118062), we get a palindrome (56199165).
The spelling of 26081103 in words is "twenty-six million, eighty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •