Base | Representation |
---|---|
bin | 110101100111001010… |
… | …0001110110111001101 |
3 | 102000011122110102111221 |
4 | 1223032110032313031 |
5 | 3341241410404244 |
6 | 124520143243341 |
7 | 11214020420116 |
oct | 1531624166715 |
9 | 360148412457 |
10 | 115130559949 |
11 | 449102217a9 |
12 | 1a390ba9551 |
13 | ab1a40c0b2 |
14 | 580274d20d |
15 | 2edc73d784 |
hex | 1ace50edcd |
115130559949 has 4 divisors (see below), whose sum is σ = 115386975900. Its totient is φ = 114874144000.
The previous prime is 115130559941. The next prime is 115130559979. The reversal of 115130559949 is 949955031511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 95462460900 + 19668099049 = 308970^2 + 140243^2 .
It is a cyclic number.
It is not a de Polignac number, because 115130559949 - 23 = 115130559941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115130559896 and 115130559905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115130559941) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128207302 + ... + 128208199.
It is an arithmetic number, because the mean of its divisors is an integer number (28846743975).
Almost surely, 2115130559949 is an apocalyptic number.
It is an amenable number.
115130559949 is a deficient number, since it is larger than the sum of its proper divisors (256415951).
115130559949 is an equidigital number, since it uses as much as digits as its factorization.
115130559949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256415950.
The product of its (nonzero) digits is 1093500, while the sum is 52.
The spelling of 115130559949 in words is "one hundred fifteen billion, one hundred thirty million, five hundred fifty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •