Base | Representation |
---|---|
bin | 11000100000110100… |
… | …000001000101101000 |
3 | 2111221022022022111201 |
4 | 120200310001011220 |
5 | 412400444420012 |
6 | 20031423333544 |
7 | 1621145643340 |
oct | 304064010550 |
9 | 74838268451 |
10 | 26320310632 |
11 | 10187146a40 |
12 | 51267512b4 |
13 | 2635c33105 |
14 | 13b9873d20 |
15 | a40a75857 |
hex | 620d01168 |
26320310632 has 32 divisors (see below), whose sum is σ = 61528000320. Its totient is φ = 10254666240.
The previous prime is 26320310629. The next prime is 26320310641. The reversal of 26320310632 is 23601302362.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 26320310632.
It is an unprimeable number.
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, 21363273 + ... + 21364504.
It is an arithmetic number, because the mean of its divisors is an integer number (1922750010).
Almost surely, 226320310632 is an apocalyptic number.
26320310632 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
26320310632 is an abundant number, since it is smaller than the sum of its proper divisors (35207689688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26320310632 is a wasteful number, since it uses less digits than its factorization.
26320310632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42727801 (or 42727797 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 26320310632 its reverse (23601302362), we get a palindrome (49921612994).
The spelling of 26320310632 in words is "twenty-six billion, three hundred twenty million, three hundred ten thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •