Base | Representation |
---|---|
bin | 111100000111011001100… |
… | …110100101101011100110 |
3 | 112121221010110110102222012 |
4 | 330013121212211223212 |
5 | 1020141010232440032 |
6 | 12441450245234222 |
7 | 604314602352233 |
oct | 74073146455346 |
9 | 15557113412865 |
10 | 4131114343142 |
11 | 1352aa5392246 |
12 | 568779a02972 |
13 | 23c7408035b7 |
14 | 103d387dc78a |
15 | 726d6a896b2 |
hex | 3c1d99a5ae6 |
4131114343142 has 8 divisors (see below), whose sum is σ = 6200267963016. Its totient is φ = 2064358355472.
The previous prime is 4131114343087. The next prime is 4131114343159. The reversal of 4131114343142 is 2413434111314.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×41311143431422 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4131114343099 and 4131114343108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 599403743 + ... + 599410634.
It is an arithmetic number, because the mean of its divisors is an integer number (775033495377).
Almost surely, 24131114343142 is an apocalyptic number.
4131114343142 is a deficient number, since it is larger than the sum of its proper divisors (2069153619874).
4131114343142 is a wasteful number, since it uses less digits than its factorization.
4131114343142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1198816102.
The product of its digits is 13824, while the sum is 32.
Adding to 4131114343142 its reverse (2413434111314), we get a palindrome (6544548454456).
The spelling of 4131114343142 in words is "four trillion, one hundred thirty-one billion, one hundred fourteen million, three hundred forty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •