Base | Representation |
---|---|
bin | 1011000111011000000000… |
… | …0111001001000111001101 |
3 | 1121021100101120222202210020 |
4 | 2301312000013021013031 |
5 | 3100213241304004401 |
6 | 41554222504132353 |
7 | 2400650661101511 |
oct | 261660007110715 |
9 | 47240346882706 |
10 | 12221331313101 |
11 | 3992045a0a289 |
12 | 14546ab1670b9 |
13 | 6a860b166201 |
14 | 303730ad8141 |
15 | 162d88e38d36 |
hex | b1d801c91cd |
12221331313101 has 8 divisors (see below), whose sum is σ = 16820757076224. Its totient is φ = 7884729879360.
The previous prime is 12221331313091. The next prime is 12221331313187. The reversal of 12221331313101 is 10131313312221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12221331313101 - 213 = 12221331304909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12221331313001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65706082236 + ... + 65706082421.
It is an arithmetic number, because the mean of its divisors is an integer number (2102594634528).
Almost surely, 212221331313101 is an apocalyptic number.
It is an amenable number.
12221331313101 is a deficient number, since it is larger than the sum of its proper divisors (4599425763123).
12221331313101 is a wasteful number, since it uses less digits than its factorization.
12221331313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131412164691.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 12221331313101 its reverse (10131313312221), we get a palindrome (22352644625322).
The spelling of 12221331313101 in words is "twelve trillion, two hundred twenty-one billion, three hundred thirty-one million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •