Base | Representation |
---|---|
bin | 1101101101011… |
… | …11011001110000 |
3 | 22000102021111100 |
4 | 12312233121300 |
5 | 213420410412 |
6 | 15225044400 |
7 | 2564411355 |
oct | 666573160 |
9 | 260367440 |
10 | 115013232 |
11 | 59a16164 |
12 | 32626700 |
13 | 1aa9c189 |
14 | 113bc62c |
15 | a16cedc |
hex | 6daf670 |
115013232 has 120 divisors (see below), whose sum is σ = 342517760. Its totient is φ = 35925120.
The previous prime is 115013219. The next prime is 115013237. The reversal of 115013232 is 232310511.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115013237) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 347307 + ... + 347637.
Almost surely, 2115013232 is an apocalyptic number.
115013232 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 115013232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171258880).
115013232 is an abundant number, since it is smaller than the sum of its proper divisors (227504528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115013232 is a wasteful number, since it uses less digits than its factorization.
115013232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 491 (or 482 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 115013232 is about 10724.4222221992. The cubic root of 115013232 is about 486.3130635468.
Adding to 115013232 its reverse (232310511), we get a palindrome (347323743).
The spelling of 115013232 in words is "one hundred fifteen million, thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •