Base | Representation |
---|---|
bin | 1100000100011101000110… |
… | …01010000000010111111001 |
3 | 10110222022211122011002211010 |
4 | 12002032203022000113321 |
5 | 11434323131044344121 |
6 | 132240531241024133 |
7 | 5406356103413640 |
oct | 602164312002771 |
9 | 113868748132733 |
10 | 26541340231161 |
11 | 85031346a1488 |
12 | 2b87a81185049 |
13 | 11a6ab73c6932 |
14 | 67a871832357 |
15 | 310603e24376 |
hex | 1823a32805f9 |
26541340231161 has 8 divisors (see below), whose sum is σ = 40443947018944. Its totient is φ = 15166480132080.
The previous prime is 26541340231067. The next prime is 26541340231207. The reversal of 26541340231161 is 16113204314562.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 26541340231161 - 27 = 26541340231033 is a prime.
It is not an unprimeable number, because it can be changed into a prime (26541340231061) 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 7 ways as a sum of consecutive naturals, for example, 631936672150 + ... + 631936672191.
It is an arithmetic number, because the mean of its divisors is an integer number (5055493377368).
Almost surely, 226541340231161 is an apocalyptic number.
26541340231161 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
26541340231161 is a deficient number, since it is larger than the sum of its proper divisors (13902606787783).
26541340231161 is a wasteful number, since it uses less digits than its factorization.
26541340231161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263873344351.
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 26541340231161 in words is "twenty-six trillion, five hundred forty-one billion, three hundred forty million, two hundred thirty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •