Base | Representation |
---|---|
bin | 1101110001100… |
… | …01001001000000 |
3 | 22001102021110010 |
4 | 12320301021000 |
5 | 214034412030 |
6 | 15244304520 |
7 | 2602053561 |
oct | 670611100 |
9 | 261367403 |
10 | 115544640 |
11 | 5a249442 |
12 | 32842140 |
13 | 1ac27013 |
14 | 114ba168 |
15 | a2256b0 |
hex | 6e31240 |
115544640 has 112 divisors (see below), whose sum is σ = 382877568. Its totient is φ = 29466624.
The previous prime is 115544629. The next prime is 115544641. The reversal of 115544640 is 46445511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 115544598 and 115544607.
It is not an unprimeable number, because it can be changed into a prime (115544641) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19464 + ... + 24696.
Almost surely, 2115544640 is an apocalyptic number.
115544640 is a gapful number since it is divisible by the number (10) 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 115544640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191438784).
115544640 is an abundant number, since it is smaller than the sum of its proper divisors (267332928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115544640 is a wasteful number, since it uses less digits than its factorization.
115544640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5276 (or 5266 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 115544640 is about 10749.1692702274. The cubic root of 115544640 is about 487.0609011310.
The spelling of 115544640 in words is "one hundred fifteen million, five hundred forty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •