Base | Representation |
---|---|
bin | 100100000011101010010000… |
… | …1011100101100010011101001 |
3 | 1112120222102122110011202112210 |
4 | 1020013110201130230103221 |
5 | 313032342114303032021 |
6 | 3042314223235355333 |
7 | 123543141314263215 |
oct | 11007244134542351 |
9 | 1476872573152483 |
10 | 317162421142761 |
11 | 9206a911367377 |
12 | 2b6a4251152b49 |
13 | 107c839890480c |
14 | 5846a59075945 |
15 | 26a01c828de76 |
hex | 120752172c4e9 |
317162421142761 has 8 divisors (see below), whose sum is σ = 423808574424544. Its totient is φ = 210978940978080.
The previous prime is 317162421142739. The next prime is 317162421142769. The reversal of 317162421142761 is 167241124261713.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 317162421142761 - 25 = 317162421142729 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 317162421142761.
It is not an unprimeable number, because it can be changed into a prime (317162421142769) 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, 115668277675 + ... + 115668280416.
It is an arithmetic number, because the mean of its divisors is an integer number (52976071803068).
Almost surely, 2317162421142761 is an apocalyptic number.
It is an amenable number.
317162421142761 is a deficient number, since it is larger than the sum of its proper divisors (106646153281783).
317162421142761 is a wasteful number, since it uses less digits than its factorization.
317162421142761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231336558551.
The product of its digits is 677376, while the sum is 48.
The spelling of 317162421142761 in words is "three hundred seventeen trillion, one hundred sixty-two billion, four hundred twenty-one million, one hundred forty-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •