Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011010100100000000011 |
3 | 1111010020122000111001112212 |
4 | 2210320330003110200003 |
5 | 2441122124043331321 |
6 | 40033241055012335 |
7 | 2246434665202052 |
oct | 244707403244003 |
9 | 44106560431485 |
10 | 11331131230211 |
11 | 36795621a5241 |
12 | 1330070b0a0ab |
13 | 6426a0ab1630 |
14 | 2b2603070399 |
15 | 149b36e4655b |
hex | a4e3c0d4803 |
11331131230211 has 8 divisors (see below), whose sum is σ = 12204370723104. Its totient is φ = 10458122310720.
The previous prime is 11331131230207. The next prime is 11331131230273. The reversal of 11331131230211 is 11203213113311.
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 11331131230211 - 22 = 11331131230207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331131233211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57541271 + ... + 57737856.
It is an arithmetic number, because the mean of its divisors is an integer number (1525546340388).
Almost surely, 211331131230211 is an apocalyptic number.
11331131230211 is a deficient number, since it is larger than the sum of its proper divisors (873239492893).
11331131230211 is a wasteful number, since it uses less digits than its factorization.
11331131230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115286701.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11331131230211 its reverse (11203213113311), we get a palindrome (22534344343522).
The spelling of 11331131230211 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •