Base | Representation |
---|---|
bin | 11000010100101000… |
… | …101111000100000111 |
3 | 2111102001220121112121 |
4 | 120110220233010013 |
5 | 411441200323011 |
6 | 15555245030411 |
7 | 1613115364222 |
oct | 302450570407 |
9 | 74361817477 |
10 | 26116026631 |
11 | 100918a8392 |
12 | 508a255407 |
13 | 2602808bc6 |
14 | 139a6985b9 |
15 | a2cb71e71 |
hex | 614a2f107 |
26116026631 has 8 divisors (see below), whose sum is σ = 26642456064. Its totient is φ = 25594002840.
The previous prime is 26116026613. The next prime is 26116026649. The reversal of 26116026631 is 13662061162.
It is an interprime number because it is at equal distance from previous prime (26116026613) and next prime (26116026649).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26116026631 - 223 = 26107638023 is a prime.
It is a super-2 number, since 2×261160266312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26116026731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1089435 + ... + 1113148.
It is an arithmetic number, because the mean of its divisors is an integer number (3330307008).
Almost surely, 226116026631 is an apocalyptic number.
26116026631 is a deficient number, since it is larger than the sum of its proper divisors (526429433).
26116026631 is a wasteful number, since it uses less digits than its factorization.
26116026631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2202821.
The product of its (nonzero) digits is 15552, while the sum is 34.
Adding to 26116026631 its reverse (13662061162), we get a palindrome (39778087793).
The spelling of 26116026631 in words is "twenty-six billion, one hundred sixteen million, twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •