Base | Representation |
---|---|
bin | 1101101111101… |
… | …10100011000100 |
3 | 22000222002020101 |
4 | 12313312203010 |
5 | 214004222034 |
6 | 15235213444 |
7 | 2600034100 |
oct | 667664304 |
9 | 260862211 |
10 | 115304644 |
11 | 5a0a50a4 |
12 | 32747284 |
13 | 1ab71a00 |
14 | 11456900 |
15 | a1c9514 |
hex | 6df68c4 |
115304644 has 81 divisors (see below), whose sum is σ = 258553197. Its totient is φ = 44841888.
The previous prime is 115304621. The next prime is 115304647. The reversal of 115304644 is 446403511.
The square root of 115304644 is 10738.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 17056900 + 98247744 = 4130^2 + 9912^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (115304647) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1954287 + ... + 1954345.
Almost surely, 2115304644 is an apocalyptic number.
115304644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
115304644 is the 10738-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115304644
115304644 is an abundant number, since it is smaller than the sum of its proper divisors (143248553).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115304644 is a wasteful number, since it uses less digits than its factorization.
115304644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162 (or 81 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The cubic root of 115304644 is about 486.7234451384.
The spelling of 115304644 in words is "one hundred fifteen million, three hundred four thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •