Base | Representation |
---|---|
bin | 1101110010010… |
… | …00111100001000 |
3 | 22001121020011111 |
4 | 12321020330020 |
5 | 214101021440 |
6 | 15250340104 |
7 | 2602641016 |
oct | 671107410 |
9 | 261536144 |
10 | 115642120 |
11 | 5a305700 |
12 | 3288a634 |
13 | 1ac5c4b9 |
14 | 115038b6 |
15 | a2444ea |
hex | 6e48f08 |
115642120 has 48 divisors (see below), whose sum is σ = 286011180. Its totient is φ = 42049920.
The previous prime is 115642081. The next prime is 115642123. The reversal of 115642120 is 21246511.
It can be written as a sum of positive squares in 2 ways, for example, as 111978724 + 3663396 = 10582^2 + 1914^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 115642091 and 115642100.
It is not an unprimeable number, because it can be changed into a prime (115642123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7107 + ... + 16786.
Almost surely, 2115642120 is an apocalyptic number.
115642120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115642120 is an abundant number, since it is smaller than the sum of its proper divisors (170369060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115642120 is a wasteful number, since it uses less digits than its factorization.
115642120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23926 (or 23911 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 115642120 is about 10753.7026181683. The cubic root of 115642120 is about 487.1978333475.
Adding to 115642120 its reverse (21246511), we get a palindrome (136888631).
The spelling of 115642120 in words is "one hundred fifteen million, six hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •