Base | Representation |
---|---|
bin | 111011101010111… |
… | …001011010111001 |
3 | 2120202202012101021 |
4 | 323222321122321 |
5 | 4022240212420 |
6 | 243201022441 |
7 | 33544134523 |
oct | 7352713271 |
9 | 2522665337 |
10 | 1001100985 |
11 | 474105a95 |
12 | 23b324a21 |
13 | 12c534361 |
14 | 96d56a13 |
15 | 5cd4c7aa |
hex | 3bab96b9 |
1001100985 has 8 divisors (see below), whose sum is σ = 1205788680. Its totient is φ = 797902464.
The previous prime is 1001100983. The next prime is 1001101021. The reversal of 1001100985 is 5890011001.
It can be written as a sum of positive squares in 4 ways, for example, as 24413481 + 976687504 = 4941^2 + 31252^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1001100985 - 21 = 1001100983 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1001100983) 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 7 ways as a sum of consecutive naturals, for example, 370812 + ... + 373501.
It is an arithmetic number, because the mean of its divisors is an integer number (150723585).
Almost surely, 21001100985 is an apocalyptic number.
It is an amenable number.
1001100985 is a deficient number, since it is larger than the sum of its proper divisors (204687695).
1001100985 is an equidigital number, since it uses as much as digits as its factorization.
1001100985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744587.
The product of its (nonzero) digits is 360, while the sum is 25.
The square root of 1001100985 is about 31640.1799141535. The cubic root of 1001100985 is about 1000.3668603970.
Adding to 1001100985 its reverse (5890011001), we get a palindrome (6891111986).
The spelling of 1001100985 in words is "one billion, one million, one hundred thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •