Base | Representation |
---|---|
bin | 110101101011101000… |
… | …1111010011101000000 |
3 | 102000120010102212210000 |
4 | 1223113101322131000 |
5 | 3342043410301013 |
6 | 124543114440000 |
7 | 11220524611263 |
oct | 1532721723500 |
9 | 360503385700 |
10 | 115280947008 |
11 | 449880a8827 |
12 | 1a413433000 |
13 | ab42615216 |
14 | 58186d8cda |
15 | 2eeaa47973 |
hex | 1ad747a740 |
115280947008 has 280 divisors, whose sum is σ = 351126360992. Its totient is φ = 37377801216.
The previous prime is 115280946961. The next prime is 115280947031. The reversal of 115280947008 is 800749082511.
It is a super-2 number, since 2×1152809470082 (a number of 23 digits) contains 22 as substring.
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 39 ways as a sum of consecutive naturals, for example, 61745691 + ... + 61747557.
Almost surely, 2115280947008 is an apocalyptic number.
115280947008 is a gapful number since it is divisible by the number (18) 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 115280947008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175563180496).
115280947008 is an abundant number, since it is smaller than the sum of its proper divisors (235845413984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115280947008 is a wasteful number, since it uses less digits than its factorization.
115280947008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2211 (or 2192 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 45.
The spelling of 115280947008 in words is "one hundred fifteen billion, two hundred eighty million, nine hundred forty-seven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •