Base | Representation |
---|---|
bin | 1011000111010111100100… |
… | …0100010100100101001010 |
3 | 1121021100002100121121100021 |
4 | 2301311321010110211022 |
5 | 3100213021030230010 |
6 | 41554203043131054 |
7 | 2400645024430501 |
oct | 261657104244512 |
9 | 47240070547307 |
10 | 12221213133130 |
11 | 3991a95230991 |
12 | 1454677673a8a |
13 | 6a85bc828831 |
14 | 30371d133838 |
15 | 162d7d8928da |
hex | b1d7911494a |
12221213133130 has 32 divisors (see below), whose sum is σ = 22524209136000. Its totient is φ = 4771736555712.
The previous prime is 12221213133053. The next prime is 12221213133137. The reversal of 12221213133130 is 3133131212221.
It is a super-2 number, since 2×122212131331302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12221213133095 and 12221213133104.
It is not an unprimeable number, because it can be changed into a prime (12221213133137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8444905 + ... + 9785644.
It is an arithmetic number, because the mean of its divisors is an integer number (703881535500).
Almost surely, 212221213133130 is an apocalyptic number.
12221213133130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12221213133130 is a deficient number, since it is larger than the sum of its proper divisors (10302996002870).
12221213133130 is a wasteful number, since it uses less digits than its factorization.
12221213133130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18232158.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12221213133130 its reverse (3133131212221), we get a palindrome (15354344345351).
The spelling of 12221213133130 in words is "twelve trillion, two hundred twenty-one billion, two hundred thirteen million, one hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •