Base | Representation |
---|---|
bin | 110001111000… |
… | …0010011100001 |
3 | 1211012120012201 |
4 | 1203300103201 |
5 | 23143300423 |
6 | 2332253201 |
7 | 435162253 |
oct | 143602341 |
9 | 54176181 |
10 | 26150113 |
11 | 13840a70 |
12 | 8911201 |
13 | 5557852 |
14 | 3689cd3 |
15 | 24682ad |
hex | 18f04e1 |
26150113 has 4 divisors (see below), whose sum is σ = 28527408. Its totient is φ = 23772820.
The previous prime is 26150107. The next prime is 26150119. The reversal of 26150113 is 31105162.
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 an interprime number because it is at equal distance from previous prime (26150107) and next prime (26150119).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26150113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26150119) 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, 1188631 + ... + 1188652.
It is an arithmetic number, because the mean of its divisors is an integer number (7131852).
Almost surely, 226150113 is an apocalyptic number.
It is an amenable number.
26150113 is a deficient number, since it is larger than the sum of its proper divisors (2377295).
26150113 is a wasteful number, since it uses less digits than its factorization.
26150113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2377294.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 26150113 is about 5113.7181189424. The cubic root of 26150113 is about 296.8186530622.
Adding to 26150113 its reverse (31105162), we get a palindrome (57255275).
The spelling of 26150113 in words is "twenty-six million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •