Base | Representation |
---|---|
bin | 1011111100000110110110… |
… | …00011011110110100010001 |
3 | 10102221220111022022200012101 |
4 | 11332003123003132310101 |
5 | 11420123221400023423 |
6 | 131501054030000401 |
7 | 5346553235241403 |
oct | 576033303366421 |
9 | 112856438280171 |
10 | 26254515236113 |
11 | 840252844042a |
12 | 2b40374046101 |
13 | 1185a36cb2158 |
14 | 66aa223b2b73 |
15 | 307e182357ad |
hex | 17e0db0ded11 |
26254515236113 has 4 divisors (see below), whose sum is σ = 26272760209920. Its totient is φ = 26236270262308.
The previous prime is 26254515236083. The next prime is 26254515236267. The reversal of 26254515236113 is 31163251545262.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26254515236113 is a prime.
It is a super-2 number, since 2×262545152361132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26254515266113) 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, 9122484745 + ... + 9122487622.
It is an arithmetic number, because the mean of its divisors is an integer number (6568190052480).
Almost surely, 226254515236113 is an apocalyptic number.
It is an amenable number.
26254515236113 is a deficient number, since it is larger than the sum of its proper divisors (18244973807).
26254515236113 is a wasteful number, since it uses less digits than its factorization.
26254515236113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18244973806.
The product of its digits is 1296000, while the sum is 46.
The spelling of 26254515236113 in words is "twenty-six trillion, two hundred fifty-four billion, five hundred fifteen million, two hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •