Base | Representation |
---|---|
bin | 1100000100011110111010… |
… | …00110110101000000000000 |
3 | 10110222102100101121021221010 |
4 | 12002033131012311000000 |
5 | 11434332123443223142 |
6 | 132241211531400520 |
7 | 5406422150360646 |
oct | 602173506650000 |
9 | 113872311537833 |
10 | 26542312476672 |
11 | 8503593488973 |
12 | 2b880b28b3140 |
13 | 11a6c10966c35 |
14 | 67a9249d7196 |
15 | 31065e471e9c |
hex | 1823dd1b5000 |
26542312476672 has 208 divisors, whose sum is σ = 73228349926080. Its totient is φ = 8540356608000.
The previous prime is 26542312476661. The next prime is 26542312476677. The reversal of 26542312476672 is 27667421324562.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26542312476677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2694372547 + ... + 2694382397.
Almost surely, 226542312476672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26542312476672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36614174963040).
26542312476672 is an abundant number, since it is smaller than the sum of its proper divisors (46686037449408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26542312476672 is an equidigital number, since it uses as much as digits as its factorization.
26542312476672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17468 (or 17446 counting only the distinct ones).
The product of its digits is 40642560, while the sum is 57.
The spelling of 26542312476672 in words is "twenty-six trillion, five hundred forty-two billion, three hundred twelve million, four hundred seventy-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •