Base | Representation |
---|---|
bin | 1001001101111011001… |
… | …00011010000011101001 |
3 | 1010021111021110221201202 |
4 | 10212331210122003221 |
5 | 20142112020102340 |
6 | 401255043453545 |
7 | 31611305336546 |
oct | 4467544320351 |
9 | 1107437427652 |
10 | 316713050345 |
11 | 1123542953aa |
12 | 5146a6872b5 |
13 | 23b34543303 |
14 | 11486a87bcd |
15 | 8389aa3c15 |
hex | 49bd91a0e9 |
316713050345 has 8 divisors (see below), whose sum is σ = 389325310920. Its totient is φ = 247190673280.
The previous prime is 316713050323. The next prime is 316713050389. The reversal of 316713050345 is 543050317613.
It can be written as a sum of positive squares in 4 ways, for example, as 2410417216 + 314302633129 = 49096^2 + 560627^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 316713050345 - 26 = 316713050281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 316713050299 and 316713050308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 772470650 + ... + 772471059.
It is an arithmetic number, because the mean of its divisors is an integer number (48665663865).
Almost surely, 2316713050345 is an apocalyptic number.
It is an amenable number.
316713050345 is a deficient number, since it is larger than the sum of its proper divisors (72612260575).
316713050345 is a wasteful number, since it uses less digits than its factorization.
316713050345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544941755.
The product of its (nonzero) digits is 113400, while the sum is 38.
Adding to 316713050345 its reverse (543050317613), we get a palindrome (859763367958).
The spelling of 316713050345 in words is "three hundred sixteen billion, seven hundred thirteen million, fifty thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •