Base | Representation |
---|---|
bin | 11000100110111000… |
… | …110010110000000000 |
3 | 2112012102002011000000 |
4 | 120212320302300000 |
5 | 413103042212140 |
6 | 20045504000000 |
7 | 1623524133426 |
oct | 304670626000 |
9 | 75172064000 |
10 | 26422225920 |
11 | 10229726452 |
12 | 5154900000 |
13 | 265109760c |
14 | 13c9203116 |
15 | a499a7a30 |
hex | 626e32c00 |
26422225920 has 308 divisors, whose sum is σ = 95043520080. Its totient is φ = 7044931584.
The previous prime is 26422225919. The next prime is 26422225957. The reversal of 26422225920 is 2952222462.
26422225920 is a `hidden beast` number, since 2 + 6 + 42 + 2 + 22 + 592 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 3728941 + ... + 3736019.
Almost surely, 226422225920 is an apocalyptic number.
26422225920 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26422225920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47521760040).
26422225920 is an abundant number, since it is smaller than the sum of its proper divisors (68621294160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26422225920 is an frugal number, since it uses more digits than its factorization.
26422225920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7122 (or 7089 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 26422225920 in words is "twenty-six billion, four hundred twenty-two million, two hundred twenty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •