Base | Representation |
---|---|
bin | 100001000111011… |
… | …1001010011101001 |
3 | 2212102220212012122 |
4 | 1002032321103221 |
5 | 4233431413001 |
6 | 302132521025 |
7 | 36352024031 |
oct | 10216712351 |
9 | 2772825178 |
10 | 1111201001 |
11 | 520275839 |
12 | 270180175 |
13 | 1492a30b1 |
14 | a78168c1 |
15 | 67849b1b |
hex | 423b94e9 |
1111201001 has 6 divisors (see below), whose sum is σ = 1161615210. Its totient is φ = 1062887408.
The previous prime is 1111200973. The next prime is 1111201009. The reversal of 1111201001 is 1001021111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1104565225 + 6635776 = 33235^2 + 2576^2 .
It is a de Polignac number, because none of the positive numbers 2k-1111201001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111201001.
It is not an unprimeable number, because it can be changed into a prime (1111201009) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1049756 + ... + 1050813.
It is an arithmetic number, because the mean of its divisors is an integer number (193602535).
Almost surely, 21111201001 is an apocalyptic number.
It is an amenable number.
1111201001 is a deficient number, since it is larger than the sum of its proper divisors (50414209).
1111201001 is an equidigital number, since it uses as much as digits as its factorization.
1111201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2100615 (or 2100592 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
The square root of 1111201001 is about 33334.6816543971. The cubic root of 1111201001 is about 1035.7720987766.
Adding to 1111201001 its reverse (1001021111), we get a palindrome (2112222112).
The spelling of 1111201001 in words is "one billion, one hundred eleven million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •