Base | Representation |
---|---|
bin | 1100001100101100000010… |
… | …1101110110111100110110 |
3 | 1202111012000210010212111212 |
4 | 3003023000231312330312 |
5 | 3224221011003121032 |
6 | 44305235435001422 |
7 | 2552664602500106 |
oct | 303130055667466 |
9 | 52435023125455 |
10 | 13412121145142 |
11 | 4301059807915 |
12 | 1607438299272 |
13 | 7639b0596495 |
14 | 345215d3d206 |
15 | 183d30280bb2 |
hex | c32c0b76f36 |
13412121145142 has 8 divisors (see below), whose sum is σ = 20125026973800. Its totient is φ = 6703778820544.
The previous prime is 13412121145079. The next prime is 13412121145151. The reversal of 13412121145142 is 24154112121431.
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×134121211451422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13412121145099 and 13412121145108.
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, 1140868667 + ... + 1140880422.
It is an arithmetic number, because the mean of its divisors is an integer number (2515628371725).
Almost surely, 213412121145142 is an apocalyptic number.
13412121145142 is a deficient number, since it is larger than the sum of its proper divisors (6712905828658).
13412121145142 is a wasteful number, since it uses less digits than its factorization.
13412121145142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2281752030.
The product of its digits is 7680, while the sum is 32.
Adding to 13412121145142 its reverse (24154112121431), we get a palindrome (37566233266573).
The spelling of 13412121145142 in words is "thirteen trillion, four hundred twelve billion, one hundred twenty-one million, one hundred forty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •