Base | Representation |
---|---|
bin | 1101101110100… |
… | …01110010000000 |
3 | 22000200102122202 |
4 | 12313101302000 |
5 | 213434412143 |
6 | 15232052332 |
7 | 2565536042 |
oct | 667216200 |
9 | 260612582 |
10 | 115154048 |
11 | 5a001a39 |
12 | 326940a8 |
13 | 1ab1b2b9 |
14 | 11417a92 |
15 | a199ab8 |
hex | 6dd1c80 |
115154048 has 32 divisors (see below), whose sum is σ = 232657920. Its totient is φ = 56761600.
The previous prime is 115154047. The next prime is 115154059. The reversal of 115154048 is 840451511.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 115154048.
It is not an unprimeable number, because it can be changed into a prime (115154047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2753 + ... + 15423.
It is an arithmetic number, because the mean of its divisors is an integer number (7270560).
Almost surely, 2115154048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115154048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116328960).
115154048 is an abundant number, since it is smaller than the sum of its proper divisors (117503872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115154048 is an equidigital number, since it uses as much as digits as its factorization.
115154048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12756 (or 12744 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 29.
The square root of 115154048 is about 10730.9854160743. The cubic root of 115154048 is about 486.5114544338.
The spelling of 115154048 in words is "one hundred fifteen million, one hundred fifty-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •