Base | Representation |
---|---|
bin | 11110000011111100000111… |
… | …111011000111111010101011 |
3 | 122100010100120100112011001020 |
4 | 132003330013323013322223 |
5 | 114312130400432242303 |
6 | 1145105223322223523 |
7 | 36564003236601231 |
oct | 3603740773077253 |
9 | 570110510464036 |
10 | 132212111212203 |
11 | 391439290201a0 |
12 | 129b3714654ba3 |
13 | 58a071933b279 |
14 | 249115941a951 |
15 | 1044218dd7a53 |
hex | 783f07ec7eab |
132212111212203 has 16 divisors (see below), whose sum is σ = 192308741587200. Its totient is φ = 80128462171680.
The previous prime is 132212111212201. The next prime is 132212111212217. The reversal of 132212111212203 is 302212111212231.
It is not a de Polignac number, because 132212111212203 - 21 = 132212111212201 is a prime.
It is a super-2 number, since 2×1322121112122032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132212111212201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38619018 + ... + 41902896.
It is an arithmetic number, because the mean of its divisors is an integer number (12019296349200).
Almost surely, 2132212111212203 is an apocalyptic number.
132212111212203 is a deficient number, since it is larger than the sum of its proper divisors (60096630374997).
132212111212203 is a wasteful number, since it uses less digits than its factorization.
132212111212203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4503922.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 132212111212203 its reverse (302212111212231), we get a palindrome (434424222424434).
The spelling of 132212111212203 in words is "one hundred thirty-two trillion, two hundred twelve billion, one hundred eleven million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.000 sec. • engine limits •