Base | Representation |
---|---|
bin | 10000100111101101000… |
… | …010101001000100000000 |
3 | 11001012001220222110202010 |
4 | 100213231002221010000 |
5 | 122203102131213422 |
6 | 2232405433052520 |
7 | 145342242144660 |
oct | 20475502510400 |
9 | 4035056873663 |
10 | 1142143226112 |
11 | 400420091589 |
12 | 165431557140 |
13 | 8391bba1765 |
14 | 3d3cc5741a0 |
15 | 1ea9a6dcb0c |
hex | 109ed0a9100 |
1142143226112 has 72 divisors (see below), whose sum is σ = 3474018995776. Its totient is φ = 326326634496.
The previous prime is 1142143226083. The next prime is 1142143226149. The reversal of 1142143226112 is 2116223412411.
It is a super-2 number, since 2×11421432261122 (a number of 25 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1142143226112.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106220743 + ... + 106231494.
Almost surely, 21142143226112 is an apocalyptic number.
1142143226112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1142143226112 is an abundant number, since it is smaller than the sum of its proper divisors (2331875769664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142143226112 is an equidigital number, since it uses as much as digits as its factorization.
1142143226112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212452263 (or 212452249 counting only the distinct ones).
The product of its digits is 4608, while the sum is 30.
Adding to 1142143226112 its reverse (2116223412411), we get a palindrome (3258366638523).
The spelling of 1142143226112 in words is "one trillion, one hundred forty-two billion, one hundred forty-three million, two hundred twenty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •