Base | Representation |
---|---|
bin | 1101101110010… |
… | …11100001000001 |
3 | 22000122010110021 |
4 | 12313023201001 |
5 | 213433102020 |
6 | 15231333441 |
7 | 2565401161 |
oct | 667134101 |
9 | 260563407 |
10 | 115128385 |
11 | 59a94729 |
12 | 32681281 |
13 | 1ab0c708 |
14 | 1140c5a1 |
15 | a1921aa |
hex | 6dcb841 |
115128385 has 8 divisors (see below), whose sum is σ = 139522536. Its totient is φ = 91190400.
The previous prime is 115128371. The next prime is 115128401. The reversal of 115128385 is 583821511.
It can be written as a sum of positive squares in 4 ways, for example, as 10291264 + 104837121 = 3208^2 + 10239^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115128385 - 219 = 114604097 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 115128385.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113484 + ... + 114493.
It is an arithmetic number, because the mean of its divisors is an integer number (17440317).
Almost surely, 2115128385 is an apocalyptic number.
It is an amenable number.
115128385 is a deficient number, since it is larger than the sum of its proper divisors (24394151).
115128385 is a wasteful number, since it uses less digits than its factorization.
115128385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228083.
The product of its digits is 9600, while the sum is 34.
The square root of 115128385 is about 10729.7896065114. The cubic root of 115128385 is about 486.4753107600.
Adding to 115128385 its reverse (583821511), we get a palindrome (698949896).
The spelling of 115128385 in words is "one hundred fifteen million, one hundred twenty-eight thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •