Base | Representation |
---|---|
bin | 100011111101100001111111… |
… | …0001100100100010100000101 |
3 | 1112110222220020210111211100221 |
4 | 1013323003332030210110011 |
5 | 312430041343111420031 |
6 | 3040431224224304341 |
7 | 123425236610616322 |
oct | 10773037614442405 |
9 | 1473886223454327 |
10 | 316320016123141 |
11 | 91875624723818 |
12 | 2b588b314720b1 |
13 | 10766b07550274 |
14 | 5817d82d77b49 |
15 | 268832229ba11 |
hex | 11fb0fe324505 |
316320016123141 has 32 divisors (see below), whose sum is σ = 340586498423808. Its totient is φ = 293063251599360.
The previous prime is 316320016123129. The next prime is 316320016123183. The reversal of 316320016123141 is 141321610023613.
It is not a de Polignac number, because 316320016123141 - 241 = 314120992867589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 316320016123097 and 316320016123106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316320016123121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2914236331 + ... + 2914344871.
It is an arithmetic number, because the mean of its divisors is an integer number (10643328075744).
Almost surely, 2316320016123141 is an apocalyptic number.
It is an amenable number.
316320016123141 is a deficient number, since it is larger than the sum of its proper divisors (24266482300667).
316320016123141 is a wasteful number, since it uses less digits than its factorization.
316320016123141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136501.
The product of its (nonzero) digits is 15552, while the sum is 34.
Adding to 316320016123141 its reverse (141321610023613), we get a palindrome (457641626146754).
The spelling of 316320016123141 in words is "three hundred sixteen trillion, three hundred twenty billion, sixteen million, one hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •