Base | Representation |
---|---|
bin | 11000010110101011… |
… | …111101001010001111 |
3 | 2111111110122020112211 |
4 | 120112223331022033 |
5 | 412024002101411 |
6 | 20002514211251 |
7 | 1614013642540 |
oct | 302653751217 |
9 | 74443566484 |
10 | 26150425231 |
11 | 100aa262587 |
12 | 5099883b27 |
13 | 2609990cc8 |
14 | 13a10904c7 |
15 | a30bb9221 |
hex | 616afd28f |
26150425231 has 4 divisors (see below), whose sum is σ = 29886200272. Its totient is φ = 22414650192.
The previous prime is 26150425177. The next prime is 26150425271. The reversal of 26150425231 is 13252405162.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13252405162 = 2 ⋅6626202581.
It is a cyclic number.
It is not a de Polignac number, because 26150425231 - 213 = 26150417039 is a prime.
It is a super-2 number, since 2×261504252312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26150425193 and 26150425202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26150425271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1867887510 + ... + 1867887523.
It is an arithmetic number, because the mean of its divisors is an integer number (7471550068).
Almost surely, 226150425231 is an apocalyptic number.
26150425231 is a deficient number, since it is larger than the sum of its proper divisors (3735775041).
26150425231 is an equidigital number, since it uses as much as digits as its factorization.
26150425231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3735775040.
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 26150425231 in words is "twenty-six billion, one hundred fifty million, four hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •