Base | Representation |
---|---|
bin | 11110000011111011001101… |
… | …100100001001010101111000 |
3 | 122100010021001010011121121002 |
4 | 132003323031210021111320 |
5 | 114312121344310011300 |
6 | 1145104542224504132 |
7 | 36563640050426363 |
oct | 3603731544112570 |
9 | 570107033147532 |
10 | 132211132110200 |
11 | 39143476380390 |
12 | 129b34a077b048 |
13 | 58a05c153a180 |
14 | 24910a538d0da |
15 | 10441ace835d5 |
hex | 783ecd909578 |
132211132110200 has 96 divisors (see below), whose sum is σ = 361130546946960. Its totient is φ = 44378561817600.
The previous prime is 132211132110193. The next prime is 132211132110209. The reversal of 132211132110200 is 2011231112231.
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 (132211132110209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2311354829 + ... + 2311412028.
Almost surely, 2132211132110200 is an apocalyptic number.
132211132110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132211132110200 is an abundant number, since it is smaller than the sum of its proper divisors (228919414836760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132211132110200 is a wasteful number, since it uses less digits than its factorization.
132211132110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4622766897 (or 4622766888 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 132211132110200 its reverse (2011231112231), we get a palindrome (134222363222431).
The spelling of 132211132110200 in words is "one hundred thirty-two trillion, two hundred eleven billion, one hundred thirty-two million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •