Base | Representation |
---|---|
bin | 1101101110011… |
… | …10101110011100 |
3 | 22000122210111012 |
4 | 12313032232130 |
5 | 213434012112 |
6 | 15231514352 |
7 | 2565454412 |
oct | 667165634 |
9 | 260583435 |
10 | 115141532 |
11 | 59aa35a0 |
12 | 326889b8 |
13 | 1ab156ac |
14 | 114132b2 |
15 | a196022 |
hex | 6dceb9c |
115141532 has 24 divisors (see below), whose sum is σ = 220089072. Its totient is φ = 52272000.
The previous prime is 115141529. The next prime is 115141547. The reversal of 115141532 is 235141511.
It is a junction number, because it is equal to n+sod(n) for n = 115141498 and 115141507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63032 + ... + 64832.
It is an arithmetic number, because the mean of its divisors is an integer number (9170378).
Almost surely, 2115141532 is an apocalyptic number.
It is an amenable number.
115141532 is a deficient number, since it is larger than the sum of its proper divisors (104947540).
115141532 is a wasteful number, since it uses less digits than its factorization.
115141532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3269 (or 3267 counting only the distinct ones).
The product of its digits is 600, while the sum is 23.
The square root of 115141532 is about 10730.4022291804. The cubic root of 115141532 is about 486.4938276168.
The spelling of 115141532 in words is "one hundred fifteen million, one hundred forty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •