Base | Representation |
---|---|
bin | 10000010101001001000… |
… | …011011110001101100000 |
3 | 10222021121220001221001221 |
4 | 100111021003132031200 |
5 | 121341242300024300 |
6 | 2215312004104424 |
7 | 144035314362145 |
oct | 20251103361540 |
9 | 3867556057057 |
10 | 1122212111200 |
11 | 3a2a22531994 |
12 | 1615aa695114 |
13 | 81a9386503b |
14 | 3c45b4a03cc |
15 | 1e2d0a2c31a |
hex | 105490de360 |
1122212111200 has 36 divisors (see below), whose sum is σ = 2739600318420. Its totient is φ = 448884844160.
The previous prime is 1122212111197. The next prime is 1122212111221. The reversal of 1122212111200 is 21112122211.
It is a super-2 number, since 2×11222121112002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 701381770 + ... + 701383369.
It is an arithmetic number, because the mean of its divisors is an integer number (76100008845).
Almost surely, 21122212111200 is an apocalyptic number.
1122212111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122212111200 is an abundant number, since it is smaller than the sum of its proper divisors (1617388207220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122212111200 is a wasteful number, since it uses less digits than its factorization.
1122212111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1402765159 (or 1402765146 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1122212111200 its reverse (21112122211), we get a palindrome (1143324233411).
The spelling of 1122212111200 in words is "one trillion, one hundred twenty-two billion, two hundred twelve million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •