Base | Representation |
---|---|
bin | 11000010100000000… |
… | …100100100010110100 |
3 | 2111101100002200200011 |
4 | 120110000210202310 |
5 | 411431001412110 |
6 | 15554231230004 |
7 | 1612630032655 |
oct | 302400444264 |
9 | 74340080604 |
10 | 26105497780 |
11 | 1008696695a |
12 | 5086818304 |
13 | 260059070b |
14 | 139911752c |
15 | a2bc9248a |
hex | 6140248b4 |
26105497780 has 24 divisors (see below), whose sum is σ = 55720261800. Its totient is φ = 10271015040.
The previous prime is 26105497751. The next prime is 26105497783. The reversal of 26105497780 is 8779450162.
It can be written as a sum of positive squares in 4 ways, for example, as 1920893584 + 24184604196 = 43828^2 + 155514^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26105497783) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10697755 + ... + 10700194.
It is an arithmetic number, because the mean of its divisors is an integer number (2321677575).
Almost surely, 226105497780 is an apocalyptic number.
26105497780 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26105497780 is an abundant number, since it is smaller than the sum of its proper divisors (29614764020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26105497780 is a wasteful number, since it uses less digits than its factorization.
26105497780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21398019 (or 21398017 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 49.
The spelling of 26105497780 in words is "twenty-six billion, one hundred five million, four hundred ninety-seven thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •