Base | Representation |
---|---|
bin | 10010111100111… |
… | …100011100011011 |
3 | 211011022100111111 |
4 | 102330330130123 |
5 | 1122344403412 |
6 | 51315041151 |
7 | 10610444614 |
oct | 2274743433 |
9 | 734270444 |
10 | 317966107 |
11 | 153535708 |
12 | 8a5a01b7 |
13 | 50b4b534 |
14 | 3032cc0b |
15 | 1cdac2a7 |
hex | 12f3c71b |
317966107 has 4 divisors (see below), whose sum is σ = 318394800. Its totient is φ = 317537416.
The previous prime is 317966093. The next prime is 317966137. The reversal of 317966107 is 701669713.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-317966107 is a prime.
It is a super-2 number, since 2×3179661072 = 202204890401470898, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 317966107.
It is not an unprimeable number, because it can be changed into a prime (317966137) 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, 213232 + ... + 214717.
It is an arithmetic number, because the mean of its divisors is an integer number (79598700).
Almost surely, 2317966107 is an apocalyptic number.
317966107 is a deficient number, since it is larger than the sum of its proper divisors (428693).
317966107 is an equidigital number, since it uses as much as digits as its factorization.
317966107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428692.
The product of its (nonzero) digits is 47628, while the sum is 40.
The square root of 317966107 is about 17831.6041622732. The cubic root of 317966107 is about 682.5381692259.
The spelling of 317966107 in words is "three hundred seventeen million, nine hundred sixty-six thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •