Base | Representation |
---|---|
bin | 10000011101101110100… |
… | …100000011010000100110 |
3 | 11000011102101200102202211 |
4 | 100131232210003100212 |
5 | 122014132410440032 |
6 | 2223434500154034 |
7 | 144512631510322 |
oct | 20355644032046 |
9 | 4004371612684 |
10 | 1131431343142 |
11 | 3a6923551341 |
12 | 16334209891a |
13 | 82902874279 |
14 | 3ca93a62982 |
15 | 1e6700b1747 |
hex | 1076e903426 |
1131431343142 has 8 divisors (see below), whose sum is σ = 1710102335832. Its totient is φ = 561397231200.
The previous prime is 1131431343127. The next prime is 1131431343157. The reversal of 1131431343142 is 2413431341311.
It is an interprime number because it is at equal distance from previous prime (1131431343127) and next prime (1131431343157).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11314313431422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2159219859 + ... + 2159220382.
It is an arithmetic number, because the mean of its divisors is an integer number (213762791979).
Almost surely, 21131431343142 is an apocalyptic number.
1131431343142 is a deficient number, since it is larger than the sum of its proper divisors (578670992690).
1131431343142 is a wasteful number, since it uses less digits than its factorization.
1131431343142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4318440374.
The product of its digits is 10368, while the sum is 31.
Adding to 1131431343142 its reverse (2413431341311), we get a palindrome (3544862684453).
The spelling of 1131431343142 in words is "one trillion, one hundred thirty-one billion, four hundred thirty-one 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 •