Base | Representation |
---|---|
bin | 1101101101101… |
… | …10001011101101 |
3 | 22000110200120222 |
4 | 12312312023231 |
5 | 213422303010 |
6 | 15225421125 |
7 | 2564555342 |
oct | 666661355 |
9 | 260420528 |
10 | 115041005 |
11 | 59a35012 |
12 | 3263a7a5 |
13 | 1aaaba01 |
14 | 113c87c9 |
15 | a176355 |
hex | 6db62ed |
115041005 has 8 divisors (see below), whose sum is σ = 140654232. Its totient is φ = 90296128.
The previous prime is 115041001. The next prime is 115041013. The reversal of 115041005 is 500140511.
It can be written as a sum of positive squares in 4 ways, for example, as 22458121 + 92582884 = 4739^2 + 9622^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 115041005 - 22 = 115041001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115041001) 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 7 ways as a sum of consecutive naturals, for example, 216794 + ... + 217323.
It is an arithmetic number, because the mean of its divisors is an integer number (17581779).
Almost surely, 2115041005 is an apocalyptic number.
It is an amenable number.
115041005 is a deficient number, since it is larger than the sum of its proper divisors (25613227).
115041005 is an equidigital number, since it uses as much as digits as its factorization.
115041005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434175.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 115041005 is about 10725.7169923507. The cubic root of 115041005 is about 486.3522047988.
Adding to 115041005 its reverse (500140511), we get a palindrome (615181516).
The spelling of 115041005 in words is "one hundred fifteen million, forty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •