Base | Representation |
---|---|
bin | 1010010010111110011111… |
… | …1100011110001101001111 |
3 | 1111002021211000210210202022 |
4 | 2210233213330132031033 |
5 | 2440441133313323343 |
6 | 40024504434320355 |
7 | 2245632106026044 |
oct | 244574774361517 |
9 | 44067730723668 |
10 | 11321130214223 |
11 | 367529a956975 |
12 | 132a13b7290bb |
13 | 641768b298ab |
14 | 2b1d34b251cb |
15 | 14974de37568 |
hex | a4be7f1e34f |
11321130214223 has 8 divisors (see below), whose sum is σ = 11425724571360. Its totient is φ = 11216549144160.
The previous prime is 11321130214213. The next prime is 11321130214231. The reversal of 11321130214223 is 32241203112311.
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 11321130214223 - 216 = 11321130148687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11321130214192 and 11321130214201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321130214213) 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, 1605740 + ... + 5022017.
It is an arithmetic number, because the mean of its divisors is an integer number (1428215571420).
Almost surely, 211321130214223 is an apocalyptic number.
11321130214223 is a deficient number, since it is larger than the sum of its proper divisors (104594357137).
11321130214223 is a wasteful number, since it uses less digits than its factorization.
11321130214223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6643537.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 11321130214223 its reverse (32241203112311), we get a palindrome (43562333326534).
The spelling of 11321130214223 in words is "eleven trillion, three hundred twenty-one billion, one hundred thirty million, two hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •