Base | Representation |
---|---|
bin | 10000100111110110011… |
… | …001100110100010000000 |
3 | 11001012110212102121022022 |
4 | 100213312121212202000 |
5 | 122203412330140000 |
6 | 2232433202301012 |
7 | 145346156556263 |
oct | 20476631464200 |
9 | 4035425377268 |
10 | 1142300240000 |
11 | 4004a0784427 |
12 | 165476057768 |
13 | 83945587c9a |
14 | 3d405366cda |
15 | 1eaa93a5585 |
hex | 109f6666880 |
1142300240000 has 80 divisors (see below), whose sum is σ = 2843685252870. Its totient is φ = 456920064000.
The previous prime is 1142300239987. The next prime is 1142300240051. The reversal of 1142300240000 is 420032411.
It can be written as a sum of positive squares in 5 ways, for example, as 71836864576 + 1070463375424 = 268024^2 + 1034632^2 .
It is a tau number, because it is divible by the number of its divisors (80).
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 9 ways as a sum of consecutive naturals, for example, 7059377 + ... + 7219376.
Almost surely, 21142300240000 is an apocalyptic number.
1142300240000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1142300240000 is an abundant number, since it is smaller than the sum of its proper divisors (1701385012870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142300240000 is an frugal number, since it uses more digits than its factorization.
1142300240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14278787 (or 14278760 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 1142300240000 its reverse (420032411), we get a palindrome (1142720272411).
The spelling of 1142300240000 in words is "one trillion, one hundred forty-two billion, three hundred million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •