Base | Representation |
---|---|
bin | 1100000000011000011100… |
… | …01001010000110011001000 |
3 | 10110110221122001022201002122 |
4 | 12000030032021100303020 |
5 | 11430030032211341030 |
6 | 132052345235350412 |
7 | 5363303223060464 |
oct | 600141611206310 |
9 | 113427561281078 |
10 | 26401401277640 |
11 | 8459853813484 |
12 | 2b64927a52408 |
13 | 119684538a01c |
14 | 673b983754a4 |
15 | 30bb637608e5 |
hex | 18030e250cc8 |
26401401277640 has 16 divisors (see below), whose sum is σ = 59403152874780. Its totient is φ = 10560560511040.
The previous prime is 26401401277637. The next prime is 26401401277649. The reversal of 26401401277640 is 4677210410462.
It can be written as a sum of positive squares in 2 ways, for example, as 23495406006436 + 2905995271204 = 4847206^2 + 1704698^2 .
It is a junction number, because it is equal to n+sod(n) for n = 26401401277591 and 26401401277600.
It is not an unprimeable number, because it can be changed into a prime (26401401277649) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 330017515931 + ... + 330017516010.
Almost surely, 226401401277640 is an apocalyptic number.
26401401277640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26401401277640 is an abundant number, since it is smaller than the sum of its proper divisors (33001751597140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26401401277640 is a wasteful number, since it uses less digits than its factorization.
26401401277640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660035031952 (or 660035031948 counting only the distinct ones).
The product of its (nonzero) digits is 451584, while the sum is 44.
The spelling of 26401401277640 in words is "twenty-six trillion, four hundred one billion, four hundred one million, two hundred seventy-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •