Base | Representation |
---|---|
bin | 1011111110000001100011… |
… | …10100011000001110000001 |
3 | 10110012012112121110222002101 |
4 | 11333000301310120032001 |
5 | 11422213132210413121 |
6 | 131551231150350401 |
7 | 5354404635363235 |
oct | 577006164301601 |
9 | 113165477428071 |
10 | 26320395404161 |
11 | 8428465041801 |
12 | 2b5109b1bb401 |
13 | 118c005a3c801 |
14 | 66dcb1ba05c5 |
15 | 3099c1d00491 |
hex | 17f031d18381 |
26320395404161 has 8 divisors (see below), whose sum is σ = 26360911748160. Its totient is φ = 26279880808272.
The previous prime is 26320395404159. The next prime is 26320395404207. The reversal of 26320395404161 is 16140459302362.
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 26320395404161 - 21 = 26320395404159 is a prime.
It is a super-3 number, since 3×263203954041613 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (26320395404461) 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, 31491676 + ... + 32316658.
It is an arithmetic number, because the mean of its divisors is an integer number (3295113968520).
Almost surely, 226320395404161 is an apocalyptic number.
It is an amenable number.
26320395404161 is a deficient number, since it is larger than the sum of its proper divisors (40516343999).
26320395404161 is an equidigital number, since it uses as much as digits as its factorization.
26320395404161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 874055.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 26320395404161 in words is "twenty-six trillion, three hundred twenty billion, three hundred ninety-five million, four hundred four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •