Base | Representation |
---|---|
bin | 1011000110110010011000… |
… | …0110101100100011111000 |
3 | 1121020101022201001120002211 |
4 | 2301230212012230203320 |
5 | 3100032100203441440 |
6 | 41545432350104504 |
7 | 2400142460361511 |
oct | 261544606544370 |
9 | 47211281046084 |
10 | 12211231312120 |
11 | 3988832803035 |
12 | 14527507ab134 |
13 | 6a768b834979 |
14 | 303053583a08 |
15 | 1629973c5eea |
hex | b1b261ac8f8 |
12211231312120 has 32 divisors (see below), whose sum is σ = 27476365302000. Its totient is φ = 4884297884928.
The previous prime is 12211231312079. The next prime is 12211231312139. The reversal of 12211231312120 is 2121313211221.
It is a happy number.
It is a super-2 number, since 2×122112313121202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12211231312091 and 12211231312100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5064045 + ... + 7075804.
Almost surely, 212211231312120 is an apocalyptic number.
12211231312120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12211231312120 is an abundant number, since it is smaller than the sum of its proper divisors (15265133989880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12211231312120 is a wasteful number, since it uses less digits than its factorization.
12211231312120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12165007 (or 12165003 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 12211231312120 its reverse (2121313211221), we get a palindrome (14332544523341).
The spelling of 12211231312120 in words is "twelve trillion, two hundred eleven billion, two hundred thirty-one million, three hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •