Base | Representation |
---|---|
bin | 1010001101110010011101… |
… | …1000111100110011111001 |
3 | 1110202202202102012121110022 |
4 | 2203130213120330303321 |
5 | 2433011114041043001 |
6 | 35515524255500225 |
7 | 2236325303360102 |
oct | 243344730746371 |
9 | 43682672177408 |
10 | 11232000331001 |
11 | 364051240745a |
12 | 1314a06227675 |
13 | 63623336a218 |
14 | 2ab8bb6053a9 |
15 | 14728418311b |
hex | a372763ccf9 |
11232000331001 has 4 divisors (see below), whose sum is σ = 11232030711972. Its totient is φ = 11231969950032.
The previous prime is 11232000330997. The next prime is 11232000331007. The reversal of 11232000331001 is 10013300023211.
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 3288959975401 + 7943040355600 = 1813549^2 + 2818340^2 .
It is a cyclic number.
It is not a de Polignac number, because 11232000331001 - 22 = 11232000330997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11232000331007) 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, 14629010 + ... + 15377643.
It is an arithmetic number, because the mean of its divisors is an integer number (2808007677993).
Almost surely, 211232000331001 is an apocalyptic number.
It is an amenable number.
11232000331001 is a deficient number, since it is larger than the sum of its proper divisors (30380971).
11232000331001 is an equidigital number, since it uses as much as digits as its factorization.
11232000331001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30380970.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11232000331001 its reverse (10013300023211), we get a palindrome (21245300354212).
The spelling of 11232000331001 in words is "eleven trillion, two hundred thirty-two billion, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •