Base | Representation |
---|---|
bin | 1101111001010… |
… | …01001100111101 |
3 | 22010022220020000 |
4 | 12330221030331 |
5 | 214314420301 |
6 | 15322144513 |
7 | 2613515055 |
oct | 674511475 |
9 | 263286200 |
10 | 116560701 |
11 | 5a882864 |
12 | 33052139 |
13 | 1b1c163a |
14 | 116a2565 |
15 | a376786 |
hex | 6f2933d |
116560701 has 20 divisors (see below), whose sum is σ = 174421500. Its totient is φ = 77573376.
The previous prime is 116560699. The next prime is 116560739. The reversal of 116560701 is 107065611.
116560701 is a `hidden beast` number, since 1 + 1 + 656 + 0 + 7 + 0 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 16040025 + 100520676 = 4005^2 + 10026^2 .
It is not a de Polignac number, because 116560701 - 21 = 116560699 is a prime.
It is a super-2 number, since 2×1165607012 = 27172794035222802, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116560751) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 74475 + ... + 76023.
It is an arithmetic number, because the mean of its divisors is an integer number (8721075).
Almost surely, 2116560701 is an apocalyptic number.
It is an amenable number.
116560701 is a deficient number, since it is larger than the sum of its proper divisors (57860799).
116560701 is an equidigital number, since it uses as much as digits as its factorization.
116560701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2490 (or 2481 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 116560701 is about 10796.3281258028. The cubic root of 116560701 is about 488.4844202663.
The spelling of 116560701 in words is "one hundred sixteen million, five hundred sixty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •