Base | Representation |
---|---|
bin | 1010001100101100110101… |
… | …1000001100001100000101 |
3 | 1110200222111212122022222120 |
4 | 2203023031120030030011 |
5 | 2432204324420010341 |
6 | 35503153523520153 |
7 | 2235064166010252 |
oct | 243131530141405 |
9 | 43628455568876 |
10 | 11213310313221 |
11 | 36335a1383475 |
12 | 131126ab29059 |
13 | 6345451b3cc3 |
14 | 2aaa272bc429 |
15 | 146a3d42a066 |
hex | a32cd60c305 |
11213310313221 has 32 divisors (see below), whose sum is σ = 16203296609280. Its totient is φ = 6870232637184.
The previous prime is 11213310313211. The next prime is 11213310313277. The reversal of 11213310313221 is 12231301331211.
It is not a de Polignac number, because 11213310313221 - 217 = 11213310182149 is a prime.
It is a super-2 number, since 2×112133103132212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11213310313191 and 11213310313200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213310313211) 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, 7038616 + ... + 8483438.
It is an arithmetic number, because the mean of its divisors is an integer number (506353019040).
Almost surely, 211213310313221 is an apocalyptic number.
It is an amenable number.
11213310313221 is a deficient number, since it is larger than the sum of its proper divisors (4989986296059).
11213310313221 is a wasteful number, since it uses less digits than its factorization.
11213310313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1448425.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11213310313221 its reverse (12231301331211), we get a palindrome (23444611644432).
The spelling of 11213310313221 in words is "eleven trillion, two hundred thirteen billion, three hundred ten million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •