Base | Representation |
---|---|
bin | 1001001100110010100… |
… | …11001110100110111111 |
3 | 1010012220212111210211010 |
4 | 10212121103032212333 |
5 | 20134340232122411 |
6 | 401114425530303 |
7 | 31560236326365 |
oct | 4463123164677 |
9 | 1105825453733 |
10 | 316104567231 |
11 | 112071872aa2 |
12 | 5131a943993 |
13 | 23a6846742b |
14 | 11429d33635 |
15 | 835145c7a6 |
hex | 49994ce9bf |
316104567231 has 4 divisors (see below), whose sum is σ = 421472756312. Its totient is φ = 210736378152.
The previous prime is 316104567227. The next prime is 316104567241. The reversal of 316104567231 is 132765401613.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 316104567231 - 22 = 316104567227 is a prime.
It is a super-2 number, since 2×3161045672312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 316104567231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316104567241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52684094536 + ... + 52684094541.
It is an arithmetic number, because the mean of its divisors is an integer number (105368189078).
Almost surely, 2316104567231 is an apocalyptic number.
316104567231 is a deficient number, since it is larger than the sum of its proper divisors (105368189081).
316104567231 is a wasteful number, since it uses less digits than its factorization.
316104567231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105368189080.
The product of its (nonzero) digits is 90720, while the sum is 39.
Adding to 316104567231 its reverse (132765401613), we get a palindrome (448869968844).
The spelling of 316104567231 in words is "three hundred sixteen billion, one hundred four million, five hundred sixty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •