Base | Representation |
---|---|
bin | 1101101110000… |
… | …11000101001100 |
3 | 22000120101001200 |
4 | 12313003011030 |
5 | 213431000321 |
6 | 15230505500 |
7 | 2565165354 |
oct | 667030514 |
9 | 260511050 |
10 | 115093836 |
11 | 59a70780 |
12 | 32665290 |
13 | 1aac9a80 |
14 | 113ddb64 |
15 | a186d26 |
hex | 6dc314c |
115093836 has 144 divisors (see below), whose sum is σ = 347343360. Its totient is φ = 31674240.
The previous prime is 115093789. The next prime is 115093879. The reversal of 115093836 is 638390511.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 115093836.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 406551 + ... + 406833.
Almost surely, 2115093836 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 115093836, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173671680).
115093836 is an abundant number, since it is smaller than the sum of its proper divisors (232249524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115093836 is a wasteful number, since it uses less digits than its factorization.
115093836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 391 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 115093836 is about 10728.1795286992. The cubic root of 115093836 is about 486.4266435930.
The spelling of 115093836 in words is "one hundred fifteen million, ninety-three thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •