Base | Representation |
---|---|
bin | 1001001100110100100… |
… | …10011000001101001101 |
3 | 1010012222000122212011101 |
4 | 10212122102120031031 |
5 | 20134404001342423 |
6 | 401120220423101 |
7 | 31560530125033 |
oct | 4463222301515 |
9 | 1105860585141 |
10 | 316121121613 |
11 | 11208014a600 |
12 | 513243a7a91 |
13 | 23a6ba1241b |
14 | 1142c202553 |
15 | 8352b2c7ad |
hex | 499a49834d |
316121121613 has 24 divisors (see below), whose sum is σ = 356906176704. Its totient is φ = 279631007040.
The previous prime is 316121121571. The next prime is 316121121629.
316121121613 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 316121121613 - 217 = 316120990541 is a prime.
It is a super-2 number, since 2×3161211216132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316121121713) 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 23 ways as a sum of consecutive naturals, for example, 1252881 + ... + 1483897.
It is an arithmetic number, because the mean of its divisors is an integer number (14871090696).
Almost surely, 2316121121613 is an apocalyptic number.
It is an amenable number.
316121121613 is a deficient number, since it is larger than the sum of its proper divisors (40785055091).
316121121613 is a wasteful number, since it uses less digits than its factorization.
316121121613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231345 (or 231334 counting only the distinct ones).
The product of its digits is 1296, while the sum is 28.
It can be divided in two parts, 316121 and 121613, that added together give a palindrome (437734).
The spelling of 316121121613 in words is "three hundred sixteen billion, one hundred twenty-one million, one hundred twenty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •