Base | Representation |
---|---|
bin | 10010111010000… |
… | …000000000000001 |
3 | 211002212010200212 |
4 | 102322000000001 |
5 | 1122200203431 |
6 | 51250323505 |
7 | 10601051360 |
oct | 2272000001 |
9 | 732763625 |
10 | 317194241 |
11 | 153058801 |
12 | 8a289595 |
13 | 5093b100 |
14 | 301ab7d7 |
15 | 1cca872b |
hex | 12e80001 |
317194241 has 24 divisors (see below), whose sum is σ = 400023360. Its totient is φ = 246182976.
The previous prime is 317194223. The next prime is 317194249. The reversal of 317194241 is 142491713.
It is a de Polignac number, because none of the positive numbers 2k-317194241 is a prime.
It is a super-2 number, since 2×3171942412 = 201224373047132162, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 317194198 and 317194207.
It is not an unprimeable number, because it can be changed into a prime (317194249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 60170 + ... + 65228.
It is an arithmetic number, because the mean of its divisors is an integer number (16667640).
It is a Proth number, since it is equal to 605 ⋅ 219 + 1 and 605 < 219.
Almost surely, 2317194241 is an apocalyptic number.
It is an amenable number.
317194241 is a deficient number, since it is larger than the sum of its proper divisors (82829119).
317194241 is a wasteful number, since it uses less digits than its factorization.
317194241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5145 (or 5132 counting only the distinct ones).
The product of its digits is 6048, while the sum is 32.
The square root of 317194241 is about 17809.9478101425. The cubic root of 317194241 is about 681.9854322473.
The spelling of 317194241 in words is "three hundred seventeen million, one hundred ninety-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •