Base | Representation |
---|---|
bin | 1101110010111… |
… | …01010000000000 |
3 | 22001202110021200 |
4 | 12321131100000 |
5 | 214111202222 |
6 | 15252221200 |
7 | 2603435403 |
oct | 671352000 |
9 | 261673250 |
10 | 115725312 |
11 | 5a36215a |
12 | 3290a800 |
13 | 1ac8b321 |
14 | 11525d3a |
15 | a25deac |
hex | 6e5d400 |
115725312 has 132 divisors (see below), whose sum is σ = 346475220. Its totient is φ = 37158912.
The previous prime is 115725287. The next prime is 115725349. The reversal of 115725312 is 213527511.
It can be written as a sum of positive squares in 2 ways, for example, as 34292736 + 81432576 = 5856^2 + 9024^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 267048 + ... + 267480.
Almost surely, 2115725312 is an apocalyptic number.
115725312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115725312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173237610).
115725312 is an abundant number, since it is smaller than the sum of its proper divisors (230749908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115725312 is a wasteful number, since it uses less digits than its factorization.
115725312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488 (or 467 counting only the distinct ones).
The product of its digits is 2100, while the sum is 27.
The square root of 115725312 is about 10757.5699858286. The cubic root of 115725312 is about 487.3146340623.
The spelling of 115725312 in words is "one hundred fifteen million, seven hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •