Base | Representation |
---|---|
bin | 1000011001100111011… |
… | …1001110000000110011 |
3 | 111210111120201100101100 |
4 | 2012121313032000303 |
5 | 4331024204411011 |
6 | 150144133535443 |
7 | 13266160616256 |
oct | 2063167160063 |
9 | 453446640340 |
10 | 144315310131 |
11 | 56227259553 |
12 | 23b76aa4583 |
13 | 107bb912045 |
14 | 6db07bd09d |
15 | 3b499cbd56 |
hex | 2199dce033 |
144315310131 has 12 divisors (see below), whose sum is σ = 208512280080. Its totient is φ = 96183976560.
The previous prime is 144315310109. The next prime is 144315310187. The reversal of 144315310131 is 131013513441.
144315310131 is a `hidden beast` number, since 1 + 4 + 4 + 315 + 310 + 1 + 31 = 666.
It is not a de Polignac number, because 144315310131 - 210 = 144315309107 is a prime.
It is a super-2 number, since 2×1443153101312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144315310095 and 144315310104.
It is not an unprimeable number, because it can be changed into a prime (144315110131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2150976 + ... + 2217053.
It is an arithmetic number, because the mean of its divisors is an integer number (17376023340).
Almost surely, 2144315310131 is an apocalyptic number.
144315310131 is a deficient number, since it is larger than the sum of its proper divisors (64196969949).
144315310131 is a wasteful number, since it uses less digits than its factorization.
144315310131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4371706 (or 4371703 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 144315310131 its reverse (131013513441), we get a palindrome (275328823572).
The spelling of 144315310131 in words is "one hundred forty-four billion, three hundred fifteen million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •