Base | Representation |
---|---|
bin | 1101101111001… |
… | …00010100111111 |
3 | 22000211021212100 |
4 | 12313210110333 |
5 | 213444330030 |
6 | 15233440143 |
7 | 2566303365 |
oct | 667442477 |
9 | 260737770 |
10 | 115230015 |
11 | 5a05401a |
12 | 32710053 |
13 | 1ab46a54 |
14 | 11437635 |
15 | a1b2360 |
hex | 6de453f |
115230015 has 24 divisors (see below), whose sum is σ = 201200688. Its totient is φ = 61004160.
The previous prime is 115230001. The next prime is 115230019. The reversal of 115230015 is 510032511.
It is not a de Polignac number, because 115230015 - 24 = 115229999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115230015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115230019) 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 23 ways as a sum of consecutive naturals, for example, 3181 + ... + 15510.
It is an arithmetic number, because the mean of its divisors is an integer number (8383362).
Almost surely, 2115230015 is an apocalyptic number.
115230015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
115230015 is a deficient number, since it is larger than the sum of its proper divisors (85970673).
115230015 is a wasteful number, since it uses less digits than its factorization.
115230015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18839 (or 18836 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 115230015 is about 10734.5244421912. The cubic root of 115230015 is about 486.6184146089.
Adding to 115230015 its reverse (510032511), we get a palindrome (625262526).
The spelling of 115230015 in words is "one hundred fifteen million, two hundred thirty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •