Base | Representation |
---|---|
bin | 111011101010111… |
… | …001001110110101 |
3 | 2120202202011022200 |
4 | 323222321032311 |
5 | 4022240201323 |
6 | 243201015113 |
7 | 33544132341 |
oct | 7352711665 |
9 | 2522664280 |
10 | 1001100213 |
11 | 474105453 |
12 | 23b324499 |
13 | 12c533bb9 |
14 | 96d56621 |
15 | 5cd4c443 |
hex | 3bab93b5 |
1001100213 has 48 divisors (see below), whose sum is σ = 1536537600. Its totient is φ = 627137280.
The previous prime is 1001100179. The next prime is 1001100223. The reversal of 1001100213 is 3120011001.
It is not a de Polignac number, because 1001100213 - 222 = 996905909 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1001100195 and 1001100204.
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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1648956 + ... + 1649562.
It is an arithmetic number, because the mean of its divisors is an integer number (32011200).
Almost surely, 21001100213 is an apocalyptic number.
It is an amenable number.
1001100213 is a deficient number, since it is larger than the sum of its proper divisors (535437387).
1001100213 is a wasteful number, since it uses less digits than its factorization.
1001100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802 (or 799 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1001100213 is about 31640.1677144733. The cubic root of 1001100213 is about 1000.3666032523.
Adding to 1001100213 its reverse (3120011001), we get a palindrome (4121111214).
The spelling of 1001100213 in words is "one billion, one million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •