Base | Representation |
---|---|
bin | 110101110010100010… |
… | …1001110101101010001 |
3 | 102001011021011011001100 |
4 | 1223211011032231101 |
5 | 3343032200044441 |
6 | 125022105455013 |
7 | 11226336035061 |
oct | 1534505165521 |
9 | 361137134040 |
10 | 115512503121 |
11 | 44a96884314 |
12 | 1a478aa1469 |
13 | ab7b59a882 |
14 | 583b3733a1 |
15 | 3011036cb6 |
hex | 1ae514eb51 |
115512503121 has 6 divisors (see below), whose sum is σ = 166851393410. Its totient is φ = 77008335408.
The previous prime is 115512503107. The next prime is 115512503153. The reversal of 115512503121 is 121305215511.
It is a happy number.
115512503121 is a `hidden beast` number, since 1 + 155 + 1 + 2 + 503 + 1 + 2 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 115301672721 + 210830400 = 339561^2 + 14520^2 .
It is not a de Polignac number, because 115512503121 - 211 = 115512501073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115512503101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6417361276 + ... + 6417361293.
Almost surely, 2115512503121 is an apocalyptic number.
It is an amenable number.
115512503121 is a deficient number, since it is larger than the sum of its proper divisors (51338890289).
115512503121 is a wasteful number, since it uses less digits than its factorization.
115512503121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12834722575 (or 12834722572 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
Adding to 115512503121 its reverse (121305215511), we get a palindrome (236817718632).
The spelling of 115512503121 in words is "one hundred fifteen billion, five hundred twelve million, five hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •