Base | Representation |
---|---|
bin | 1101001000001011010111… |
… | …1010000100101010110011 |
3 | 1220002220001011201100100020 |
4 | 3102002311322010222303 |
5 | 3342442110323423011 |
6 | 50410541525054523 |
7 | 3016555331523300 |
oct | 322026572045263 |
9 | 56086034640306 |
10 | 14434142014131 |
11 | 4665537962594 |
12 | 1751524b57443 |
13 | 809197b0cac8 |
14 | 37c88abda0a7 |
15 | 1a06e9d99006 |
hex | d20b5e84ab3 |
14434142014131 has 48 divisors (see below), whose sum is σ = 22467378205440. Its totient is φ = 8218734068160.
The previous prime is 14434142014067. The next prime is 14434142014177. The reversal of 14434142014131 is 13141024143441.
It is not a de Polignac number, because 14434142014131 - 26 = 14434142014067 is a prime.
It is a super-2 number, since 2×144341420141312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14434142014092 and 14434142014101.
It is not an unprimeable number, because it can be changed into a prime (14434142010131) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 91347565 + ... + 91505441.
It is an arithmetic number, because the mean of its divisors is an integer number (468070379280).
Almost surely, 214434142014131 is an apocalyptic number.
14434142014131 is a deficient number, since it is larger than the sum of its proper divisors (8033236191309).
14434142014131 is a wasteful number, since it uses less digits than its factorization.
14434142014131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160104 (or 160097 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
Adding to 14434142014131 its reverse (13141024143441), we get a palindrome (27575166157572).
The spelling of 14434142014131 in words is "fourteen trillion, four hundred thirty-four billion, one hundred forty-two million, fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •