Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01001001011111101 |
3 | 1001122120121110211221 |
4 | 22111213021023331 |
5 | 140213100013041 |
6 | 5033235313341 |
7 | 542032311004 |
oct | 122547111375 |
9 | 31576543757 |
10 | 11100001021 |
11 | 478673006a |
12 | 219944b851 |
13 | 107b86b755 |
14 | 7742a1c3b |
15 | 44e7442d1 |
hex | 2959c92fd |
11100001021 has 4 divisors (see below), whose sum is σ = 11100261600. Its totient is φ = 11099740444.
The previous prime is 11100000983. The next prime is 11100001027. The reversal of 11100001021 is 12010000111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11100001021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11100000995 and 11100001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100001027) 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 3 ways as a sum of consecutive naturals, for example, 49831 + ... + 157108.
It is an arithmetic number, because the mean of its divisors is an integer number (2775065400).
Almost surely, 211100001021 is an apocalyptic number.
It is an amenable number.
11100001021 is a deficient number, since it is larger than the sum of its proper divisors (260579).
11100001021 is an equidigital number, since it uses as much as digits as its factorization.
11100001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260578.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11100001021 its reverse (12010000111), we get a palindrome (23110001132).
The spelling of 11100001021 in words is "eleven billion, one hundred million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •