Base | Representation |
---|---|
bin | 110101110111101110… |
… | …1110000110101010000 |
3 | 102001121101221121011210 |
4 | 1223233131300311100 |
5 | 3343411244102022 |
6 | 125051251340120 |
7 | 11233552531506 |
oct | 1535735606520 |
9 | 361541847153 |
10 | 115686706512 |
11 | 45076147963 |
12 | 1a5072b1640 |
13 | aba86c21c0 |
14 | 585655c676 |
15 | 3021497a0c |
hex | 1aef770d50 |
115686706512 has 80 divisors (see below), whose sum is σ = 322687346688. Its totient is φ = 35502896640.
The previous prime is 115686706453. The next prime is 115686706529. The reversal of 115686706512 is 215607686511.
It is a super-2 number, since 2×1156867065122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3039 + ... + 481022.
Almost surely, 2115686706512 is an apocalyptic number.
115686706512 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 115686706512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161343673344).
115686706512 is an abundant number, since it is smaller than the sum of its proper divisors (207000640176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115686706512 is a wasteful number, since it uses less digits than its factorization.
115686706512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484468 (or 484462 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 48.
The spelling of 115686706512 in words is "one hundred fifteen billion, six hundred eighty-six million, seven hundred six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •