Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110101011100010001101 |
3 | 1111010020122002010210202021 |
4 | 2210320330012223202031 |
5 | 2441122124310022424 |
6 | 40033241125530141 |
7 | 2246435005530655 |
oct | 244707406534215 |
9 | 44106562123667 |
10 | 11331132110989 |
11 | 3679562746a59 |
12 | 1330071273951 |
13 | 6426a102c4c2 |
14 | 2b260321d365 |
15 | 149b3706c4e4 |
hex | a4e3c1ab88d |
11331132110989 has 4 divisors (see below), whose sum is σ = 11331161752860. Its totient is φ = 11331102469120.
The previous prime is 11331132110981. The next prime is 11331132111011. The reversal of 11331132110989 is 98901123113311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6047836785225 + 5283295325764 = 2459235^2 + 2298542^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331132110989 - 23 = 11331132110981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331132110981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14239942 + ... + 15014599.
It is an arithmetic number, because the mean of its divisors is an integer number (2832790438215).
Almost surely, 211331132110989 is an apocalyptic number.
It is an amenable number.
11331132110989 is a deficient number, since it is larger than the sum of its proper divisors (29641871).
11331132110989 is an equidigital number, since it uses as much as digits as its factorization.
11331132110989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29641870.
The product of its (nonzero) digits is 34992, while the sum is 43.
The spelling of 11331132110989 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •