Base | Representation |
---|---|
bin | 1100000100011010111000… |
… | …10011110010011001010011 |
3 | 10110222012202210120001020200 |
4 | 12002031130103302121103 |
5 | 11434313212303104021 |
6 | 132240213300510243 |
7 | 5406314461341621 |
oct | 602153423623123 |
9 | 113865683501220 |
10 | 26540151613011 |
11 | 850268475a033 |
12 | 2b877ab0ab383 |
13 | 11a6958088c9a |
14 | 67a79ba26511 |
15 | 3105848d6126 |
hex | 18235c4f2653 |
26540151613011 has 12 divisors (see below), whose sum is σ = 38335907162280. Its totient is φ = 17693373204000.
The previous prime is 26540151612991. The next prime is 26540151613021. The reversal of 26540151613011 is 11031615104562.
26540151613011 is a `hidden beast` number, since 2 + 6 + 5 + 4 + 0 + 1 + 516 + 130 + 1 + 1 = 666.
It is not a de Polignac number, because 26540151613011 - 25 = 26540151612979 is a prime.
It is a super-2 number, since 2×265401516130112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (26540151613021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2271490 + ... + 7631511.
It is an arithmetic number, because the mean of its divisors is an integer number (3194658930190).
Almost surely, 226540151613011 is an apocalyptic number.
26540151613011 is a deficient number, since it is larger than the sum of its proper divisors (11795755549269).
26540151613011 is a wasteful number, since it uses less digits than its factorization.
26540151613011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10200786 (or 10200783 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
Adding to 26540151613011 its reverse (11031615104562), we get a palindrome (37571766717573).
The spelling of 26540151613011 in words is "twenty-six trillion, five hundred forty billion, one hundred fifty-one million, six hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •