Base | Representation |
---|---|
bin | 1001001101011101000… |
… | …00010010001001011011 |
3 | 1010020211122220110201010 |
4 | 10212232200102021123 |
5 | 20141102314424011 |
6 | 401214014425003 |
7 | 31602116155536 |
oct | 4465640221133 |
9 | 1106748813633 |
10 | 316460311131 |
11 | 112234660718 |
12 | 513b9b02163 |
13 | 23ac4081b93 |
14 | 11461297a1d |
15 | 83727cd1a6 |
hex | 49ae81225b |
316460311131 has 8 divisors (see below), whose sum is σ = 444154822720. Its totient is φ = 199869670152.
The previous prime is 316460311127. The next prime is 316460311183. The reversal of 316460311131 is 131113064613.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 316460311131 - 22 = 316460311127 is a prime.
It is a super-2 number, since 2×3164603111312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (316460312131) 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 7 ways as a sum of consecutive naturals, for example, 2775967585 + ... + 2775967698.
It is an arithmetic number, because the mean of its divisors is an integer number (55519352840).
Almost surely, 2316460311131 is an apocalyptic number.
316460311131 is a deficient number, since it is larger than the sum of its proper divisors (127694511589).
316460311131 is a wasteful number, since it uses less digits than its factorization.
316460311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5551935305.
The product of its (nonzero) digits is 3888, while the sum is 30.
Adding to 316460311131 its reverse (131113064613), we get a palindrome (447573375744).
The spelling of 316460311131 in words is "three hundred sixteen billion, four hundred sixty million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •