Base | Representation |
---|---|
bin | 1101101111110… |
… | …01000110111010 |
3 | 22000222121121202 |
4 | 12313321012322 |
5 | 214010041010 |
6 | 15235334202 |
7 | 2600106500 |
oct | 667710672 |
9 | 260877552 |
10 | 115315130 |
11 | 5a101a67 |
12 | 32751362 |
13 | 1ab76708 |
14 | 1145a670 |
15 | a1cc6a5 |
hex | 6df91ba |
115315130 has 24 divisors (see below), whose sum is σ = 241456788. Its totient is φ = 39536448.
The previous prime is 115315117. The next prime is 115315139. The reversal of 115315130 is 31513511.
It can be written as a sum of positive squares in 2 ways, for example, as 114854089 + 461041 = 10717^2 + 679^2 .
It is not an unprimeable number, because it can be changed into a prime (115315139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 117179 + ... + 118158.
Almost surely, 2115315130 is an apocalyptic number.
115315130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115315130 is an abundant number, since it is smaller than the sum of its proper divisors (126141658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115315130 is a wasteful number, since it uses less digits than its factorization.
115315130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235358 (or 235351 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 20.
The square root of 115315130 is about 10738.4882548709. The cubic root of 115315130 is about 486.7381991765.
Adding to 115315130 its reverse (31513511), we get a palindrome (146828641).
It can be divided in two parts, 11531 and 5130, that added together give a palindrome (16661).
The spelling of 115315130 in words is "one hundred fifteen million, three hundred fifteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •