Base | Representation |
---|---|
bin | 11000100110010100… |
… | …110010000100010101 |
3 | 2112011202022112210011 |
4 | 120212110302010111 |
5 | 413043133122231 |
6 | 20044525400221 |
7 | 1623350655553 |
oct | 304624620425 |
9 | 75152275704 |
10 | 26412785941 |
11 | 10224369013 |
12 | 5151709071 |
13 | 264c140929 |
14 | 13c7c66bd3 |
15 | a48c409b1 |
hex | 626532115 |
26412785941 has 4 divisors (see below), whose sum is σ = 26413220512. Its totient is φ = 26412351372.
The previous prime is 26412785929. The next prime is 26412785953. The reversal of 26412785941 is 14958721462.
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 an interprime number because it is at equal distance from previous prime (26412785929) and next prime (26412785953).
It is a cyclic number.
It is not a de Polignac number, because 26412785941 - 27 = 26412785813 is a prime.
It is a super-2 number, since 2×264127859412 (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 (26412705941) 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, 107691 + ... + 253816.
It is an arithmetic number, because the mean of its divisors is an integer number (6603305128).
Almost surely, 226412785941 is an apocalyptic number.
It is an amenable number.
26412785941 is a deficient number, since it is larger than the sum of its proper divisors (434571).
26412785941 is an equidigital number, since it uses as much as digits as its factorization.
26412785941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 434570.
The product of its digits is 967680, while the sum is 49.
The spelling of 26412785941 in words is "twenty-six billion, four hundred twelve million, seven hundred eighty-five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •