Base | Representation |
---|---|
bin | 1010010010111110110101… |
… | …1010101001010101101111 |
3 | 1111002022001102112112012011 |
4 | 2210233231122221111233 |
5 | 2440441330313311343 |
6 | 40024521514022051 |
7 | 2245634302211626 |
oct | 244575532512557 |
9 | 44068042475164 |
10 | 11321222010223 |
11 | 3675337754634 |
12 | 132a166417927 |
13 | 641781b5a158 |
14 | 2b1d42dbc6bd |
15 | 14975701b29d |
hex | a4bed6a956f |
11321222010223 has 8 divisors (see below), whose sum is σ = 11604041514576. Its totient is φ = 11038721179200.
The previous prime is 11321222010127. The next prime is 11321222010257. The reversal of 11321222010223 is 32201022212311.
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 11321222010223 - 221 = 11321219913071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11321222010194 and 11321222010203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321222010823) 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, 79596393 + ... + 79738498.
It is an arithmetic number, because the mean of its divisors is an integer number (1450505189322).
Almost surely, 211321222010223 is an apocalyptic number.
11321222010223 is a deficient number, since it is larger than the sum of its proper divisors (282819504353).
11321222010223 is a wasteful number, since it uses less digits than its factorization.
11321222010223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159336665.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 11321222010223 its reverse (32201022212311), we get a palindrome (43522244222534).
The spelling of 11321222010223 in words is "eleven trillion, three hundred twenty-one billion, two hundred twenty-two million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •