Base | Representation |
---|---|
bin | 1101110111011… |
… | …01110011110111 |
3 | 22002212112112000 |
4 | 12323231303313 |
5 | 214234124211 |
6 | 15313030343 |
7 | 2611452606 |
oct | 673556367 |
9 | 262775460 |
10 | 116317431 |
11 | 5a72700a |
12 | 32b553b3 |
13 | 1b1379a9 |
14 | 1163ba3d |
15 | a329656 |
hex | 6eedcf7 |
116317431 has 8 divisors (see below), whose sum is σ = 172322160. Its totient is φ = 77544936.
The previous prime is 116317403. The next prime is 116317441. The reversal of 116317431 is 134713611.
It is not a de Polignac number, because 116317431 - 26 = 116317367 is a prime.
It is a super-2 number, since 2×1163174312 = 27059489508879522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4308053 = 116317431 / (1 + 1 + 6 + 3 + 1 + 7 + 4 + 3 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 116317395 and 116317404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116317441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2154000 + ... + 2154053.
It is an arithmetic number, because the mean of its divisors is an integer number (21540270).
Almost surely, 2116317431 is an apocalyptic number.
116317431 is a deficient number, since it is larger than the sum of its proper divisors (56004729).
116317431 is an equidigital number, since it uses as much as digits as its factorization.
116317431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4308062 (or 4308056 counting only the distinct ones).
The product of its digits is 1512, while the sum is 27.
The square root of 116317431 is about 10785.0559108426. The cubic root of 116317431 is about 488.1443503253.
The spelling of 116317431 in words is "one hundred sixteen million, three hundred seventeen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •