Base | Representation |
---|---|
bin | 11000001111101110… |
… | …010110100101001011 |
3 | 2111012022211120110202 |
4 | 120033232112211023 |
5 | 411304101110011 |
6 | 15543142402415 |
7 | 1611065026511 |
oct | 301756264513 |
9 | 74168746422 |
10 | 26033613131 |
11 | 1004a328959 |
12 | 506673040b |
13 | 25bb712116 |
14 | 138d7644b1 |
15 | a257e323b |
hex | 60fb9694b |
26033613131 has 4 divisors (see below), whose sum is σ = 26141636664. Its totient is φ = 25925589600.
The previous prime is 26033613121. The next prime is 26033613167. The reversal of 26033613131 is 13131633062.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13131633062 = 2 ⋅6565816531.
It is a cyclic number.
It is not a de Polignac number, because 26033613131 - 210 = 26033612107 is a prime.
It is a super-2 number, since 2×260336131312 (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 = 26033613094 and 26033613103.
It is not an unprimeable number, because it can be changed into a prime (26033613121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54011405 + ... + 54011886.
It is an arithmetic number, because the mean of its divisors is an integer number (6535409166).
Almost surely, 226033613131 is an apocalyptic number.
26033613131 is a deficient number, since it is larger than the sum of its proper divisors (108023533).
26033613131 is a wasteful number, since it uses less digits than its factorization.
26033613131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108023532.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 26033613131 in words is "twenty-six billion, thirty-three million, six hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •