Base | Representation |
---|---|
bin | 1010001101000101110000… |
… | …1111110011000010000100 |
3 | 1110201121210020122112100201 |
4 | 2203101130033303002010 |
5 | 2432312031032102322 |
6 | 35510221534420244 |
7 | 2235422054211100 |
oct | 243213417630204 |
9 | 43647706575321 |
10 | 11220002222212 |
11 | 3636415827773 |
12 | 1312618061684 |
13 | 635070718474 |
14 | 2ab09dd5a900 |
15 | 146cd0b87d27 |
hex | a345c3f3084 |
11220002222212 has 72 divisors (see below), whose sum is σ = 24168742295040. Its totient is φ = 4531638605760.
The previous prime is 11220002222203. The next prime is 11220002222227. The reversal of 11220002222212 is 21222220002211.
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 11220002222212.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 7175863 + ... + 8598430.
It is an arithmetic number, because the mean of its divisors is an integer number (335676976320).
Almost surely, 211220002222212 is an apocalyptic number.
It is an amenable number.
11220002222212 is an abundant number, since it is smaller than the sum of its proper divisors (12948740072828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220002222212 is a wasteful number, since it uses less digits than its factorization.
11220002222212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15774521 (or 15774512 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 11220002222212 its reverse (21222220002211), we get a palindrome (32442222224423).
The spelling of 11220002222212 in words is "eleven trillion, two hundred twenty billion, two million, two hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •