Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …1010011111011111010111 |
3 | 1111010020122011000120110020 |
4 | 2210320330022133133113 |
5 | 2441122130034011411 |
6 | 40033241203200223 |
7 | 2246435020162134 |
oct | 244707412373727 |
9 | 44106564016406 |
10 | 11331133110231 |
11 | 3679563269780 |
12 | 1330071676073 |
13 | 6426a12bc27c |
14 | 2b26033dd58b |
15 | 149b371b8606 |
hex | a4e3c29f7d7 |
11331133110231 has 32 divisors (see below), whose sum is σ = 17184232857600. Its totient is φ = 6578338999680.
The previous prime is 11331133110203. The next prime is 11331133110239. The reversal of 11331133110231 is 13201133113311.
It is not a de Polignac number, because 11331133110231 - 213 = 11331133102039 is a prime.
It is a super-2 number, since 2×113311331102312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331133110239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46493676 + ... + 46736753.
It is an arithmetic number, because the mean of its divisors is an integer number (537007276800).
Almost surely, 211331133110231 is an apocalyptic number.
11331133110231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11331133110231 is a deficient number, since it is larger than the sum of its proper divisors (5853099747369).
11331133110231 is a wasteful number, since it uses less digits than its factorization.
11331133110231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93230599.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 11331133110231 its reverse (13201133113311), we get a palindrome (24532266223542).
The spelling of 11331133110231 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-three million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •