Base | Representation |
---|---|
bin | 100010000000010… |
… | …0111001100010110 |
3 | 2221112000101010220 |
4 | 1010000213030112 |
5 | 4314044324342 |
6 | 305115455210 |
7 | 40163302221 |
oct | 10400471426 |
9 | 2845011126 |
10 | 1141011222 |
11 | 53608668a |
12 | 27a157506 |
13 | 15250c890 |
14 | ab7765b8 |
15 | 6a2875ec |
hex | 44027316 |
1141011222 has 64 divisors (see below), whose sum is σ = 2559211200. Its totient is φ = 336844800.
The previous prime is 1141011211. The next prime is 1141011227. The reversal of 1141011222 is 2221101411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141011227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 192154 + ... + 198002.
It is an arithmetic number, because the mean of its divisors is an integer number (39987675).
Almost surely, 21141011222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1141011222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1279605600).
1141011222 is an abundant number, since it is smaller than the sum of its proper divisors (1418199978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141011222 is a wasteful number, since it uses less digits than its factorization.
1141011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5969.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 1141011222 is about 33778.8576183387. The cubic root of 1141011222 is about 1044.9527147549.
Adding to 1141011222 its reverse (2221101411), we get a palindrome (3362112633).
The spelling of 1141011222 in words is "one billion, one hundred forty-one million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •