Base | Representation |
---|---|
bin | 10101000101011110… |
… | …01011101011111110 |
3 | 1002012220222100211100 |
4 | 22202233023223332 |
5 | 141140433242342 |
6 | 5111143233530 |
7 | 550345134114 |
oct | 124257135376 |
9 | 32186870740 |
10 | 11320212222 |
11 | 4889a67aa0 |
12 | 223b1488a6 |
13 | 10b5381337 |
14 | 795625ab4 |
15 | 463c41e4c |
hex | 2a2bcbafe |
11320212222 has 48 divisors (see below), whose sum is σ = 27002392560. Its totient is φ = 3398889600.
The previous prime is 11320212221. The next prime is 11320212227. The reversal of 11320212222 is 22221202311.
It is a super-3 number, since 3×113202122223 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11320212195 and 11320212204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11320212221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 240679 + ... + 283842.
It is an arithmetic number, because the mean of its divisors is an integer number (562549845).
Almost surely, 211320212222 is an apocalyptic number.
11320212222 is an abundant number, since it is smaller than the sum of its proper divisors (15682180338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11320212222 is a wasteful number, since it uses less digits than its factorization.
11320212222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524649 (or 524646 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 11320212222 its reverse (22221202311), we get a palindrome (33541414533).
The spelling of 11320212222 in words is "eleven billion, three hundred twenty million, two hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •