Base | Representation |
---|---|
bin | 110001110011… |
… | …1000000011111 |
3 | 1211010121222021 |
4 | 1203213000133 |
5 | 23141041111 |
6 | 2331401011 |
7 | 434643241 |
oct | 143470037 |
9 | 54117867 |
10 | 26112031 |
11 | 138153a0 |
12 | 88b3167 |
13 | 554340a |
14 | 367a091 |
15 | 245bd71 |
hex | 18e701f |
26112031 has 4 divisors (see below), whose sum is σ = 28485864. Its totient is φ = 23738200.
The previous prime is 26112029. The next prime is 26112041. The reversal of 26112031 is 13021162.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 26112031 - 21 = 26112029 is a prime.
It is a super-2 number, since 2×261120312 = 1363676325889922, which contains 22 as substring.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 26111996 and 26112014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26112011) 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, 1186900 + ... + 1186921.
It is an arithmetic number, because the mean of its divisors is an integer number (7121466).
Almost surely, 226112031 is an apocalyptic number.
26112031 is a deficient number, since it is larger than the sum of its proper divisors (2373833).
26112031 is a wasteful number, since it uses less digits than its factorization.
26112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2373832.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 26112031 is about 5109.9932485278. The cubic root of 26112031 is about 296.6744989446.
Adding to 26112031 its reverse (13021162), we get a palindrome (39133193).
The spelling of 26112031 in words is "twenty-six million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •