Base | Representation |
---|---|
bin | 1101101110001… |
… | …11111011111001 |
3 | 22000121101100011 |
4 | 12313013323321 |
5 | 213432114341 |
6 | 15231141521 |
7 | 2565310342 |
oct | 667077371 |
9 | 260541304 |
10 | 115113721 |
11 | 59a84708 |
12 | 326748a1 |
13 | 1ab05b38 |
14 | 114070c9 |
15 | a18cb81 |
hex | 6dc7ef9 |
115113721 has 8 divisors (see below), whose sum is σ = 117724104. Its totient is φ = 112519680.
The previous prime is 115113671. The next prime is 115113751. The reversal of 115113721 is 127311511.
It can be written as a sum of positive squares in 4 ways, for example, as 7182400 + 107931321 = 2680^2 + 10389^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115113721 - 211 = 115111673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115113692 and 115113701.
It is not an unprimeable number, because it can be changed into a prime (115113751) 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 7 ways as a sum of consecutive naturals, for example, 10761 + ... + 18601.
It is an arithmetic number, because the mean of its divisors is an integer number (14715513).
Almost surely, 2115113721 is an apocalyptic number.
It is an amenable number.
115113721 is a deficient number, since it is larger than the sum of its proper divisors (2610383).
115113721 is an equidigital number, since it uses as much as digits as its factorization.
115113721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8171.
The product of its digits is 210, while the sum is 22.
The square root of 115113721 is about 10729.1062535516. The cubic root of 115113721 is about 486.4546556254.
The spelling of 115113721 in words is "one hundred fifteen million, one hundred thirteen thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •