Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110010010111011100011 |
3 | 1111010020122001221200111202 |
4 | 2210320330012102323203 |
5 | 2441122124243311321 |
6 | 40033241123431415 |
7 | 2246435004631106 |
oct | 244707406227343 |
9 | 44106561850452 |
10 | 11331132010211 |
11 | 3679562688272 |
12 | 133007122556b |
13 | 6426a0cc5680 |
14 | 2b26031d473d |
15 | 149b3704c70b |
hex | a4e3c192ee3 |
11331132010211 has 8 divisors (see below), whose sum is σ = 12202787314704. Its totient is φ = 10459480957920.
The previous prime is 11331132010199. The next prime is 11331132010249. The reversal of 11331132010211 is 11201023113311.
11331132010211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11331132010211 - 238 = 11056254103267 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331132010291) 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, 6425096 + ... + 7996506.
It is an arithmetic number, because the mean of its divisors is an integer number (1525348414338).
Almost surely, 211331132010211 is an apocalyptic number.
11331132010211 is a deficient number, since it is larger than the sum of its proper divisors (871655304493).
11331132010211 is a wasteful number, since it uses less digits than its factorization.
11331132010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2126101.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11331132010211 its reverse (11201023113311), we get a palindrome (22532155123522).
The spelling of 11331132010211 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •