Base | Representation |
---|---|
bin | 111011101010111… |
… | …001001110111110 |
3 | 2120202202011100000 |
4 | 323222321032332 |
5 | 4022240201342 |
6 | 243201015130 |
7 | 33544132353 |
oct | 7352711676 |
9 | 2522664300 |
10 | 1001100222 |
11 | 474105461 |
12 | 23b3244a6 |
13 | 12c533bc5 |
14 | 96d5662a |
15 | 5cd4c44c |
hex | 3bab93be |
1001100222 has 48 divisors (see below), whose sum is σ = 2269416240. Its totient is φ = 330728832.
The previous prime is 1001100179. The next prime is 1001100223. The reversal of 1001100222 is 2220011001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001100223) 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, 45804 + ... + 64032.
It is an arithmetic number, because the mean of its divisors is an integer number (47279505).
Almost surely, 21001100222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001100222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1134708120).
1001100222 is an abundant number, since it is smaller than the sum of its proper divisors (1268316018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001100222 is a wasteful number, since it uses less digits than its factorization.
1001100222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18359 (or 18347 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1001100222 is about 31640.1678566976. The cubic root of 1001100222 is about 1000.3666062501.
Adding to 1001100222 its reverse (2220011001), we get a palindrome (3221111223).
The spelling of 1001100222 in words is "one billion, one million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •