Base | Representation |
---|---|
bin | 1100000001101111010100… |
… | …1000111111001111110101 |
3 | 1201211012111211121220100220 |
4 | 3000123311020333033311 |
5 | 3213130244130024341 |
6 | 44043010515524553 |
7 | 2533255411210155 |
oct | 300336510771765 |
9 | 51735454556326 |
10 | 13224022111221 |
11 | 4239304806679 |
12 | 1596aa22b9759 |
13 | 74c034a45c8c |
14 | 33a09065a765 |
15 | 17dec1a18a66 |
hex | c06f523f3f5 |
13224022111221 has 32 divisors (see below), whose sum is σ = 17765822638080. Its totient is φ = 8749354123776.
The previous prime is 13224022111199. The next prime is 13224022111247. The reversal of 13224022111221 is 12211122042231.
It is not a de Polignac number, because 13224022111221 - 221 = 13224020014069 is a prime.
It is a super-2 number, since 2×132240221112212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13224022111191 and 13224022111200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13224022111271) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1252388140 + ... + 1252398698.
It is an arithmetic number, because the mean of its divisors is an integer number (555181957440).
Almost surely, 213224022111221 is an apocalyptic number.
It is an amenable number.
13224022111221 is a deficient number, since it is larger than the sum of its proper divisors (4541800526859).
13224022111221 is a wasteful number, since it uses less digits than its factorization.
13224022111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15853.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 13224022111221 its reverse (12211122042231), we get a palindrome (25435144153452).
The spelling of 13224022111221 in words is "thirteen trillion, two hundred twenty-four billion, twenty-two million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •