Base | Representation |
---|---|
bin | 11000101011110010… |
… | …011011000101101000 |
3 | 2112102010210011120000 |
4 | 120223302123011220 |
5 | 413240114122331 |
6 | 20102002103000 |
7 | 1625543020200 |
oct | 305362330550 |
9 | 75363704500 |
10 | 26504442216 |
11 | 102710807aa |
12 | 517834aa60 |
13 | 2665122705 |
14 | 13d60c5400 |
15 | a51ce80e6 |
hex | 62bc9b168 |
26504442216 has 240 divisors, whose sum is σ = 86670460800. Its totient is φ = 7545254976.
The previous prime is 26504442203. The next prime is 26504442221. The reversal of 26504442216 is 61224440562.
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 (17) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 9746505 + ... + 9749223.
It is an arithmetic number, because the mean of its divisors is an integer number (361126920).
Almost surely, 226504442216 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 26504442216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43335230400).
26504442216 is an abundant number, since it is smaller than the sum of its proper divisors (60166018584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26504442216 is a wasteful number, since it uses less digits than its factorization.
26504442216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3058 (or 3038 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 36.
Adding to 26504442216 its reverse (61224440562), we get a palindrome (87728882778).
The spelling of 26504442216 in words is "twenty-six billion, five hundred four million, four hundred forty-two thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •