Base | Representation |
---|---|
bin | 10000010101000100110… |
… | …001001101001110111000 |
3 | 10222021102212210011221002 |
4 | 100111010301031032320 |
5 | 121341120343323300 |
6 | 2215300515104132 |
7 | 144033452304665 |
oct | 20250461151670 |
9 | 3867385704832 |
10 | 1122140214200 |
11 | 3a2995995685 |
12 | 16158a5a2048 |
13 | 81a819b0c35 |
14 | 3c451b06a6c |
15 | 1e2c95795d5 |
hex | 10544c4d3b8 |
1122140214200 has 48 divisors (see below), whose sum is σ = 2609089053000. Its totient is φ = 448836635520.
The previous prime is 1122140214191. The next prime is 1122140214203. The reversal of 1122140214200 is 24120412211.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122140214203) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 5055146 + ... + 5272454.
Almost surely, 21122140214200 is an apocalyptic number.
1122140214200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122140214200 is an abundant number, since it is smaller than the sum of its proper divisors (1486948838800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122140214200 is a wasteful number, since it uses less digits than its factorization.
1122140214200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243144 (or 243135 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1122140214200 its reverse (24120412211), we get a palindrome (1146260626411).
The spelling of 1122140214200 in words is "one trillion, one hundred twenty-two billion, one hundred forty million, two hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •