Base | Representation |
---|---|
bin | 11000101001001100… |
… | …110100111011101101 |
3 | 2112022010002201011122 |
4 | 120221030310323231 |
5 | 413143011012143 |
6 | 20053411430325 |
7 | 1624505030252 |
oct | 305114647355 |
9 | 75263081148 |
10 | 26461032173 |
11 | 10249621134 |
12 | 51658b53a5 |
13 | 26591339b4 |
14 | 13d0425429 |
15 | a4d0c0c68 |
hex | 629334eed |
26461032173 has 12 divisors (see below), whose sum is σ = 27352749024. Its totient is φ = 25597524600.
The previous prime is 26461032161. The next prime is 26461032179. The reversal of 26461032173 is 37123016462.
It is a de Polignac number, because none of the positive numbers 2k-26461032173 is a prime.
It is a super-2 number, since 2×264610321732 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26461032179) 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 11 ways as a sum of consecutive naturals, for example, 4189688 + ... + 4195998.
It is an arithmetic number, because the mean of its divisors is an integer number (2279395752).
Almost surely, 226461032173 is an apocalyptic number.
It is an amenable number.
26461032173 is a deficient number, since it is larger than the sum of its proper divisors (891716851).
26461032173 is an equidigital number, since it uses as much as digits as its factorization.
26461032173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10736 (or 10705 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 35.
The spelling of 26461032173 in words is "twenty-six billion, four hundred sixty-one million, thirty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •