Base | Representation |
---|---|
bin | 1011110111100111001110… |
… | …01100011111000001000001 |
3 | 10102102010220212000000102001 |
4 | 11323303213030133001001 |
5 | 11410111001111201121 |
6 | 131302115341424001 |
7 | 5332445545241563 |
oct | 573634714370101 |
9 | 112363825000361 |
10 | 26100100100161 |
11 | 8352a9909529a |
12 | 2b1645a86b001 |
13 | 11742c8b00519 |
14 | 6633744c7333 |
15 | 303dcbc2c991 |
hex | 17bce731f041 |
26100100100161 has 8 divisors (see below), whose sum is σ = 26779881290400. Its totient is φ = 25422375737760.
The previous prime is 26100100100159. The next prime is 26100100100189. The reversal of 26100100100161 is 16100100100162.
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 26100100100161 - 21 = 26100100100159 is a prime.
It is a super-3 number, since 3×261001001001613 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26100100100101) 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, 514181251 + ... + 514232008.
It is an arithmetic number, because the mean of its divisors is an integer number (3347485161300).
Almost surely, 226100100100161 is an apocalyptic number.
It is an amenable number.
26100100100161 is a deficient number, since it is larger than the sum of its proper divisors (679781190239).
26100100100161 is a wasteful number, since it uses less digits than its factorization.
26100100100161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1028413919.
The product of its (nonzero) digits is 72, while the sum is 19.
Subtracting from 26100100100161 its reverse (16100100100162), we obtain a palindrome (9999999999999).
The spelling of 26100100100161 in words is "twenty-six trillion, one hundred billion, one hundred million, one hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •