Base | Representation |
---|---|
bin | 11000101010011101… |
… | …100111010000001000 |
3 | 2112100120221122102012 |
4 | 120222131213100020 |
5 | 413213421203200 |
6 | 20055445355052 |
7 | 1625153032514 |
oct | 305235472010 |
9 | 75316848365 |
10 | 26482209800 |
11 | 1025a576202 |
12 | 5170a08a88 |
13 | 266063a137 |
14 | 13d3179144 |
15 | a4eda5a35 |
hex | 62a767408 |
26482209800 has 108 divisors (see below), whose sum is σ = 63484325415. Its totient is φ = 10273449600.
The previous prime is 26482209773. The next prime is 26482209811. The reversal of 26482209800 is 890228462.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 21003545476 + 5478664324 = 144926^2 + 74018^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=115070.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 85151645 + ... + 85151955.
Almost surely, 226482209800 is an apocalyptic number.
26482209800 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 26482209800
26482209800 is an abundant number, since it is smaller than the sum of its proper divisors (37002115615).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26482209800 is an equidigital number, since it uses as much as digits as its factorization.
26482209800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712 (or 355 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 41.
The spelling of 26482209800 in words is "twenty-six billion, four hundred eighty-two million, two hundred nine thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •