Base | Representation |
---|---|
bin | 1101101110001… |
… | …11101100101101 |
3 | 22000121100000011 |
4 | 12313013230231 |
5 | 213432101444 |
6 | 15231133221 |
7 | 2565304453 |
oct | 667075455 |
9 | 260540004 |
10 | 115112749 |
11 | 59a83a04 |
12 | 32674211 |
13 | 1ab0556b |
14 | 114069d3 |
15 | a18c734 |
hex | 6dc7b2d |
115112749 has 4 divisors (see below), whose sum is σ = 115134940. Its totient is φ = 115090560.
The previous prime is 115112747. The next prime is 115112759. The reversal of 115112749 is 947211511.
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 89680900 + 25431849 = 9470^2 + 5043^2 .
It is a cyclic number.
It is not a de Polignac number, because 115112749 - 21 = 115112747 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115112749.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115112741) 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 3 ways as a sum of consecutive naturals, for example, 1309 + ... + 15229.
It is an arithmetic number, because the mean of its divisors is an integer number (28783735).
Almost surely, 2115112749 is an apocalyptic number.
It is an amenable number.
115112749 is a deficient number, since it is larger than the sum of its proper divisors (22191).
115112749 is an equidigital number, since it uses as much as digits as its factorization.
115112749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22190.
The product of its digits is 2520, while the sum is 31.
The square root of 115112749 is about 10729.0609561135. The cubic root of 115112749 is about 486.4532864424.
The spelling of 115112749 in words is "one hundred fifteen million, one hundred twelve thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •