Base | Representation |
---|---|
bin | 1101101111001… |
… | …01100011100000 |
3 | 22000211112202110 |
4 | 12313211203200 |
5 | 214000010130 |
6 | 15233515320 |
7 | 2566324134 |
oct | 667454340 |
9 | 260745673 |
10 | 115235040 |
11 | 5a057878 |
12 | 32712b40 |
13 | 1ab4911b |
14 | 114393c4 |
15 | a1b3ab0 |
hex | 6de58e0 |
115235040 has 48 divisors (see below), whose sum is σ = 362991888. Its totient is φ = 30729216.
The previous prime is 115235033. The next prime is 115235093. The reversal of 115235040 is 40532511.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1152350402 = 26558228887603200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115234998 and 115235016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119557 + ... + 120516.
It is an arithmetic number, because the mean of its divisors is an integer number (7562331).
Almost surely, 2115235040 is an apocalyptic number.
115235040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115235040 is an abundant number, since it is smaller than the sum of its proper divisors (247756848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115235040 is a wasteful number, since it uses less digits than its factorization.
115235040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240091 (or 240083 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 115235040 is about 10734.7584975164. The cubic root of 115235040 is about 486.6254880610.
Adding to 115235040 its reverse (40532511), we get a palindrome (155767551).
The spelling of 115235040 in words is "one hundred fifteen million, two hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •