Base | Representation |
---|---|
bin | 1011000111010110110100… |
… | …0010000000110010111011 |
3 | 1121021022120021122101211022 |
4 | 2301311231002000302323 |
5 | 3100212112331414321 |
6 | 41554131031053055 |
7 | 2400640023145631 |
oct | 261655502006273 |
9 | 47238507571738 |
10 | 12221011201211 |
11 | 39919a12494aa |
12 | 145461bb1118b |
13 | 6a8589a460a7 |
14 | 3037003ab351 |
15 | 162d6aca5dab |
hex | b1d6d080cbb |
12221011201211 has 16 divisors (see below), whose sum is σ = 12680030361600. Its totient is φ = 11766054738240.
The previous prime is 12221011201183. The next prime is 12221011201279. The reversal of 12221011201211 is 11210211012221.
It is a cyclic number.
It is not a de Polignac number, because 12221011201211 - 214 = 12221011184827 is a prime.
It is a super-2 number, since 2×122210112012112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12221011201211.
It is not an unprimeable number, because it can be changed into a prime (12221011203211) 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, 58297295 + ... + 58506551.
It is an arithmetic number, because the mean of its divisors is an integer number (792501897600).
Almost surely, 212221011201211 is an apocalyptic number.
12221011201211 is a deficient number, since it is larger than the sum of its proper divisors (459019160389).
12221011201211 is a wasteful number, since it uses less digits than its factorization.
12221011201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218954.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12221011201211 its reverse (11210211012221), we get a palindrome (23431222213432).
The spelling of 12221011201211 in words is "twelve trillion, two hundred twenty-one billion, eleven million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •