Base | Representation |
---|---|
bin | 1001001100100111110… |
… | …10111100111001010111 |
3 | 1010012200120200121222021 |
4 | 10212103322330321113 |
5 | 20134144131122033 |
6 | 401101443314011 |
7 | 31555062242530 |
oct | 4462372747127 |
9 | 1105616617867 |
10 | 316014317143 |
11 | 112025930848 |
12 | 512b467b907 |
13 | 23a52858705 |
14 | 1141bd5d687 |
15 | 8348581b2d |
hex | 4993ebce57 |
316014317143 has 8 divisors (see below), whose sum is σ = 382403879712. Its totient is φ = 254935919616.
The previous prime is 316014317117. The next prime is 316014317147. The reversal of 316014317143 is 341713410613.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-316014317143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 316014317099 and 316014317108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316014317147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1327791130 + ... + 1327791367.
It is an arithmetic number, because the mean of its divisors is an integer number (47800484964).
Almost surely, 2316014317143 is an apocalyptic number.
316014317143 is a deficient number, since it is larger than the sum of its proper divisors (66389562569).
316014317143 is a wasteful number, since it uses less digits than its factorization.
316014317143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2655582521.
The product of its (nonzero) digits is 18144, while the sum is 34.
Adding to 316014317143 its reverse (341713410613), we get a palindrome (657727727756).
The spelling of 316014317143 in words is "three hundred sixteen billion, fourteen million, three hundred seventeen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •