Base | Representation |
---|---|
bin | 1010001101001101100101… |
… | …1010001101000011000100 |
3 | 1110201211012120221111012001 |
4 | 2203103121122031003010 |
5 | 2432330331114232322 |
6 | 35511210150235044 |
7 | 2235525102665161 |
oct | 243233132150304 |
9 | 43654176844161 |
10 | 11222102102212 |
11 | 36372a3093691 |
12 | 1312b03355a84 |
13 | 635316793801 |
14 | 2ab21cbb5068 |
15 | 146da51c9827 |
hex | a34d968d0c4 |
11222102102212 has 24 divisors (see below), whose sum is σ = 20672537407200. Its totient is φ = 5315669816256.
The previous prime is 11222102102201. The next prime is 11222102102219. The reversal of 11222102102212 is 21220120122211.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 11222102102212.
It is not an unprimeable number, because it can be changed into a prime (11222102102219) 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, 5957739 + ... + 7611757.
It is an arithmetic number, because the mean of its divisors is an integer number (861355725300).
Almost surely, 211222102102212 is an apocalyptic number.
It is an amenable number.
11222102102212 is a deficient number, since it is larger than the sum of its proper divisors (9450435304988).
11222102102212 is a wasteful number, since it uses less digits than its factorization.
11222102102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1743315 (or 1743313 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11222102102212 its reverse (21220120122211), we get a palindrome (32442222224423).
The spelling of 11222102102212 in words is "eleven trillion, two hundred twenty-two billion, one hundred two million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •