Base | Representation |
---|---|
bin | 1101101101110… |
… | …11101110111100 |
3 | 22000111211210000 |
4 | 12312323232330 |
5 | 213424014430 |
6 | 15230114300 |
7 | 2565011541 |
oct | 666735674 |
9 | 260454700 |
10 | 115063740 |
11 | 59a50100 |
12 | 3264b990 |
13 | 1aab916c |
14 | 113d2bc8 |
15 | a17ce60 |
hex | 6dbbbbc |
115063740 has 180 divisors, whose sum is σ = 397432728. Its totient is φ = 27846720.
The previous prime is 115063721. The next prime is 115063757. The reversal of 115063740 is 47360511.
It is a tau number, because it is divible by the number of its divisors (180).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 195727 + ... + 196313.
Almost surely, 2115063740 is an apocalyptic number.
115063740 is a gapful number since it is divisible by the number (10) 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 115063740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198716364).
115063740 is an abundant number, since it is smaller than the sum of its proper divisors (282368988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115063740 is a wasteful number, since it uses less digits than its factorization.
115063740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630 (or 608 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 115063740 is about 10726.7767759006. The cubic root of 115063740 is about 486.3842411702.
The spelling of 115063740 in words is "one hundred fifteen million, sixty-three thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •