Base | Representation |
---|---|
bin | 110101110010001100… |
… | …0000000111010010100 |
3 | 102001010102211221210202 |
4 | 1223210120000322110 |
5 | 3343021131301012 |
6 | 125021003440032 |
7 | 11226133220210 |
oct | 1534430007224 |
9 | 361112757722 |
10 | 115500650132 |
11 | 44a90118a5a |
12 | 1a474b26018 |
13 | ab78caa77a |
14 | 5839969940 |
15 | 300ee94cc2 |
hex | 1ae4600e94 |
115500650132 has 24 divisors (see below), whose sum is σ = 231016808064. Its totient is φ = 49496955552.
The previous prime is 115500650117. The next prime is 115500650137. The reversal of 115500650132 is 231056005511.
115500650132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 115500650095 and 115500650104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115500650137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311753 + ... + 572879.
It is an arithmetic number, because the mean of its divisors is an integer number (9625700336).
Almost surely, 2115500650132 is an apocalyptic number.
It is an amenable number.
115500650132 is an abundant number, since it is smaller than the sum of its proper divisors (115516157932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115500650132 is a wasteful number, since it uses less digits than its factorization.
115500650132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276935 (or 276933 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 115500650132 its reverse (231056005511), we get a palindrome (346556655643).
The spelling of 115500650132 in words is "one hundred fifteen billion, five hundred million, six hundred fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •