Base | Representation |
---|---|
bin | 110101100111001010… |
… | …0001110101001001011 |
3 | 102000011122110101021200 |
4 | 1223032110032221023 |
5 | 3341241410342201 |
6 | 124520143235243 |
7 | 11214020414364 |
oct | 1531624165113 |
9 | 360148411250 |
10 | 115130559051 |
11 | 44910221062 |
12 | 1a390ba8b23 |
13 | ab1a40b871 |
14 | 580274cb6b |
15 | 2edc73d386 |
hex | 1ace50ea4b |
115130559051 has 24 divisors (see below), whose sum is σ = 169158085200. Its totient is φ = 75439558656.
The previous prime is 115130558953. The next prime is 115130559067. The reversal of 115130559051 is 150955031511.
115130559051 is a `hidden beast` number, since 1 + 1 + 5 + 13 + 0 + 5 + 590 + 51 = 666.
It is not a de Polignac number, because 115130559051 - 213 = 115130550859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115130558997 and 115130559015.
It is not an unprimeable number, because it can be changed into a prime (115130559151) 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 23 ways as a sum of consecutive naturals, for example, 58131 + ... + 483363.
It is an arithmetic number, because the mean of its divisors is an integer number (7048253550).
Almost surely, 2115130559051 is an apocalyptic number.
115130559051 is a deficient number, since it is larger than the sum of its proper divisors (54027526149).
115130559051 is a wasteful number, since it uses less digits than its factorization.
115130559051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425755 (or 425752 counting only the distinct ones).
The product of its (nonzero) digits is 16875, while the sum is 36.
The spelling of 115130559051 in words is "one hundred fifteen billion, one hundred thirty million, five hundred fifty-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •