Base | Representation |
---|---|
bin | 1011110111010011110001… |
… | …01101100001001111000000 |
3 | 10102101010222000121220221002 |
4 | 11323221320231201033000 |
5 | 11404423104034220212 |
6 | 131253231152151132 |
7 | 5331626003461442 |
oct | 573517055411700 |
9 | 112333860556832 |
10 | 26089656554432 |
11 | 8349619a72869 |
12 | 2b144252384a8 |
13 | 1173323266073 |
14 | 662a634a6492 |
15 | 3039b9e58ac2 |
hex | 17ba78b613c0 |
26089656554432 has 56 divisors (see below), whose sum is σ = 52309404491472. Its totient is φ = 12909458432000.
The previous prime is 26089656554431. The next prime is 26089656554459. The reversal of 26089656554432 is 23445565698062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26089656554431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12481823 + ... + 14421345.
Almost surely, 226089656554432 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 26089656554432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26154702245736).
26089656554432 is an abundant number, since it is smaller than the sum of its proper divisors (26219747937040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26089656554432 is a wasteful number, since it uses less digits than its factorization.
26089656554432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941717 (or 1941707 counting only the distinct ones).
The product of its (nonzero) digits is 373248000, while the sum is 65.
The spelling of 26089656554432 in words is "twenty-six trillion, eighty-nine billion, six hundred fifty-six million, five hundred fifty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •