Base | Representation |
---|---|
bin | 11000111001010111… |
… | …000001101110111100 |
3 | 2120000000020111020211 |
4 | 120321113001232330 |
5 | 414221412012000 |
6 | 20140334322204 |
7 | 1634306311411 |
oct | 307127015674 |
9 | 76000214224 |
10 | 26732141500 |
11 | 10378662629 |
12 | 5220659364 |
13 | 26a035770c |
14 | 1418438108 |
15 | a66cc47ba |
hex | 6395c1bbc |
26732141500 has 48 divisors (see below), whose sum is σ = 58446329760. Its totient is φ = 10681257600.
The previous prime is 26732141489. The next prime is 26732141533. The reversal of 26732141500 is 514123762.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 439971 + ... + 497029.
It is an arithmetic number, because the mean of its divisors is an integer number (1217631870).
Almost surely, 226732141500 is an apocalyptic number.
26732141500 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 26732141500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29223164880).
26732141500 is an abundant number, since it is smaller than the sum of its proper divisors (31714188260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26732141500 is a wasteful number, since it uses less digits than its factorization.
26732141500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58015 (or 58003 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The spelling of 26732141500 in words is "twenty-six billion, seven hundred thirty-two million, one hundred forty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.984 sec. • engine limits •