Base | Representation |
---|---|
bin | 10001110011010011000… |
… | …001100001010011110101 |
3 | 11022221120122122211221211 |
4 | 101303103001201103311 |
5 | 130020320120300341 |
6 | 2333551550241421 |
7 | 154244534545054 |
oct | 21632301412365 |
9 | 4287518584854 |
10 | 1223311103221 |
11 | 431892253a59 |
12 | 1791044b6271 |
13 | 8b485c616cc |
14 | 432cc47a39b |
15 | 21c4b49e181 |
hex | 11cd30614f5 |
1223311103221 has 16 divisors (see below), whose sum is σ = 1275406668288. Its totient is φ = 1172007576000.
The previous prime is 1223311103191. The next prime is 1223311103291. The reversal of 1223311103221 is 1223011133221.
It is not a de Polignac number, because 1223311103221 - 231 = 1221163619573 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1223311103192 and 1223311103201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223311103291) 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 15 ways as a sum of consecutive naturals, for example, 51502470 + ... + 51526216.
It is an arithmetic number, because the mean of its divisors is an integer number (79712916768).
Almost surely, 21223311103221 is an apocalyptic number.
It is an amenable number.
1223311103221 is a deficient number, since it is larger than the sum of its proper divisors (52095565067).
1223311103221 is a wasteful number, since it uses less digits than its factorization.
1223311103221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40332.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1223311103221 its reverse (1223011133221), we get a palindrome (2446322236442).
The spelling of 1223311103221 in words is "one trillion, two hundred twenty-three billion, three hundred eleven million, one hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •