Base | Representation |
---|---|
bin | 1101111001011… |
… | …00100111101101 |
3 | 22010100121102112 |
4 | 12330230213231 |
5 | 214320342301 |
6 | 15322333405 |
7 | 2613603635 |
oct | 674544755 |
9 | 263317375 |
10 | 116574701 |
11 | 5a892331 |
12 | 3305a265 |
13 | 1b1c7b19 |
14 | 116a76c5 |
15 | a37a9bb |
hex | 6f2c9ed |
116574701 has 4 divisors (see below), whose sum is σ = 116597052. Its totient is φ = 116552352.
The previous prime is 116574641. The next prime is 116574803. The reversal of 116574701 is 107475611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 107475611 = 71 ⋅1513741.
It can be written as a sum of positive squares in 2 ways, for example, as 12432676 + 104142025 = 3526^2 + 10205^2 .
It is a cyclic number.
It is not a de Polignac number, because 116574701 - 218 = 116312557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116571701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1265 + ... + 15321.
It is an arithmetic number, because the mean of its divisors is an integer number (29149263).
Almost surely, 2116574701 is an apocalyptic number.
It is an amenable number.
116574701 is a deficient number, since it is larger than the sum of its proper divisors (22351).
116574701 is an equidigital number, since it uses as much as digits as its factorization.
116574701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22350.
The product of its (nonzero) digits is 5880, while the sum is 32.
The square root of 116574701 is about 10796.9764749211. The cubic root of 116574701 is about 488.5039766235.
The spelling of 116574701 in words is "one hundred sixteen million, five hundred seventy-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •