Base | Representation |
---|---|
bin | 10010110101101… |
… | …000101001111111 |
3 | 211000201000011022 |
4 | 102311220221333 |
5 | 1121402100142 |
6 | 51210014355 |
7 | 10555244465 |
oct | 2265505177 |
9 | 730630138 |
10 | 316050047 |
11 | 152447095 |
12 | 89a173bb |
13 | 5062a381 |
14 | 2dd90835 |
15 | 1cb2e6d2 |
hex | 12d68a7f |
316050047 has 4 divisors (see below), whose sum is σ = 332684280. Its totient is φ = 299415816.
The previous prime is 316050023. The next prime is 316050083. The reversal of 316050047 is 740050613.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 316050047 - 28 = 316049791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 316049998 and 316050025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316053047) 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, 8317088 + ... + 8317125.
It is an arithmetic number, because the mean of its divisors is an integer number (83171070).
Almost surely, 2316050047 is an apocalyptic number.
316050047 is a deficient number, since it is larger than the sum of its proper divisors (16634233).
316050047 is a wasteful number, since it uses less digits than its factorization.
316050047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16634232.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 316050047 is about 17777.7964607541. The cubic root of 316050047 is about 681.1644171367.
The spelling of 316050047 in words is "three hundred sixteen million, fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •