Base | Representation |
---|---|
bin | 110101101000001000… |
… | …1111111001111110100 |
3 | 102000020221111021121200 |
4 | 1223100101333033310 |
5 | 3341323330314012 |
6 | 124523322012500 |
7 | 11214600551334 |
oct | 1532021771764 |
9 | 360227437550 |
10 | 115163526132 |
11 | 44927898786 |
12 | 1a3a0047130 |
13 | ab241b2205 |
14 | 5806c910c4 |
15 | 2ee05a13dc |
hex | 1ad047f3f4 |
115163526132 has 72 divisors (see below), whose sum is σ = 294440967912. Its totient is φ = 37949472000.
The previous prime is 115163526073. The next prime is 115163526187. The reversal of 115163526132 is 231625361511.
115163526132 is a `hidden beast` number, since 1 + 1 + 5 + 1 + 6 + 35 + 2 + 613 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 39123257616 + 76040268516 = 197796^2 + 275754^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2379438 + ... + 2427354.
Almost surely, 2115163526132 is an apocalyptic number.
115163526132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115163526132 is an abundant number, since it is smaller than the sum of its proper divisors (179277441780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115163526132 is a wasteful number, since it uses less digits than its factorization.
115163526132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48689 (or 48684 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
Adding to 115163526132 its reverse (231625361511), we get a palindrome (346788887643).
The spelling of 115163526132 in words is "one hundred fifteen billion, one hundred sixty-three million, five hundred twenty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •