Base | Representation |
---|---|
bin | 1010001101110110100011… |
… | …1101000111011111111001 |
3 | 1110202212121002001101210001 |
4 | 2203131220331013133321 |
5 | 2433020342141043001 |
6 | 35520225352353001 |
7 | 2236364461253143 |
oct | 243355075073771 |
9 | 43685532041701 |
10 | 11233100331001 |
11 | 3640a2732176a |
12 | 13150726a5761 |
13 | 63637a21abb3 |
14 | 2ab983743c93 |
15 | 1472eaa19001 |
hex | a3768f477f9 |
11233100331001 has 8 divisors (see below), whose sum is σ = 11315362821984. Its totient is φ = 11150841739680.
The previous prime is 11233100330999. The next prime is 11233100331007. The reversal of 11233100331001 is 10013300133211.
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 11233100331001 - 21 = 11233100330999 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 11233100331001.
It is not an unprimeable number, because it can be changed into a prime (11233100331007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4938066 + ... + 6844756.
It is an arithmetic number, because the mean of its divisors is an integer number (1414420352748).
Almost surely, 211233100331001 is an apocalyptic number.
It is an amenable number.
11233100331001 is a deficient number, since it is larger than the sum of its proper divisors (82262490983).
11233100331001 is a wasteful number, since it uses less digits than its factorization.
11233100331001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1949831.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11233100331001 its reverse (10013300133211), we get a palindrome (21246400464212).
The spelling of 11233100331001 in words is "eleven trillion, two hundred thirty-three billion, one hundred million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •