Base | Representation |
---|---|
bin | 1010010011100100000011… |
… | …0100000111100110111011 |
3 | 1111010020211120211110021022 |
4 | 2210321000310013212323 |
5 | 2441122310022200243 |
6 | 40033253031333055 |
7 | 2246436655303646 |
oct | 244710064074673 |
9 | 44106746743238 |
10 | 11331211131323 |
11 | 36795a3309116 |
12 | 133009382118b |
13 | 6426b45089b5 |
14 | 2b260d90ca5d |
15 | 149b3de7ab68 |
hex | a4e40d079bb |
11331211131323 has 4 divisors (see below), whose sum is σ = 11607582134568. Its totient is φ = 11054840128080.
The previous prime is 11331211131293. The next prime is 11331211131341. The reversal of 11331211131323 is 32313111213311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11331211131323 - 218 = 11331210869179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11331211131292 and 11331211131301.
It is not an unprimeable number, because it can be changed into a prime (11331211131353) 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, 138185501561 + ... + 138185501642.
It is an arithmetic number, because the mean of its divisors is an integer number (2901895533642).
Almost surely, 211331211131323 is an apocalyptic number.
11331211131323 is a deficient number, since it is larger than the sum of its proper divisors (276371003245).
11331211131323 is an equidigital number, since it uses as much as digits as its factorization.
11331211131323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276371003244.
The product of its digits is 972, while the sum is 26.
Adding to 11331211131323 its reverse (32313111213311), we get a palindrome (43644322344634).
The spelling of 11331211131323 in words is "eleven trillion, three hundred thirty-one billion, two hundred eleven million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •