Base | Representation |
---|---|
bin | 1100000001000111001001… |
… | …00011100011111011000100 |
3 | 10110120100100100211001111010 |
4 | 12000203210203203323010 |
5 | 11430432404133114140 |
6 | 132112053152442220 |
7 | 5365151434034220 |
oct | 600434443437304 |
9 | 113510310731433 |
10 | 26426473332420 |
11 | 846944a294307 |
12 | 2b69764549370 |
13 | 119900c8013b5 |
14 | 675096117780 |
15 | 30c62e917880 |
hex | 1808e48e3ec4 |
26426473332420 has 96 divisors (see below), whose sum is σ = 84626850744576. Its totient is φ = 6035898470400.
The previous prime is 26426473332409. The next prime is 26426473332439. The reversal of 26426473332420 is 2423337462462.
It is a self number, because there is not a number n which added to its sum of digits gives 26426473332420.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 22543801 + ... + 23687040.
It is an arithmetic number, because the mean of its divisors is an integer number (881529695256).
Almost surely, 226426473332420 is an apocalyptic number.
26426473332420 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26426473332420 is an abundant number, since it is smaller than the sum of its proper divisors (58200377412156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26426473332420 is a wasteful number, since it uses less digits than its factorization.
26426473332420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46232221 (or 46232219 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 48.
The spelling of 26426473332420 in words is "twenty-six trillion, four hundred twenty-six billion, four hundred seventy-three million, three hundred thirty-two thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •