Base | Representation |
---|---|
bin | 1001001110000101110… |
… | …00111011001001011010 |
3 | 1010021201111110001121020 |
4 | 10213002320323021122 |
5 | 20142302343033332 |
6 | 401311553023310 |
7 | 31613441150106 |
oct | 4470270731132 |
9 | 1107644401536 |
10 | 316802314842 |
11 | 11239a714112 |
12 | 51494554b36 |
13 | 23b49b98540 |
14 | 11494882906 |
15 | 839283782c |
hex | 49c2e3b25a |
316802314842 has 64 divisors (see below), whose sum is σ = 699456231936. Its totient is φ = 95041033920.
The previous prime is 316802314793. The next prime is 316802314849. The reversal of 316802314842 is 248413208613.
It is a junction number, because it is equal to n+sod(n) for n = 316802314794 and 316802314803.
It is not an unprimeable number, because it can be changed into a prime (316802314849) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1804417 + ... + 1972187.
It is an arithmetic number, because the mean of its divisors is an integer number (10929003624).
Almost surely, 2316802314842 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 316802314842, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (349728115968).
316802314842 is an abundant number, since it is smaller than the sum of its proper divisors (382653917094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
316802314842 is a wasteful number, since it uses less digits than its factorization.
316802314842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168395.
The product of its (nonzero) digits is 221184, while the sum is 42.
The spelling of 316802314842 in words is "three hundred sixteen billion, eight hundred two million, three hundred fourteen thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •