Base | Representation |
---|---|
bin | 1010010010111110110001… |
… | …0010001101010110100111 |
3 | 1111002022000002210210011212 |
4 | 2210233230102031112213 |
5 | 2440441310433134343 |
6 | 40024515555022035 |
7 | 2245633651623254 |
oct | 244575422152647 |
9 | 44068002723155 |
10 | 11321203021223 |
11 | 3675327a64947 |
12 | 132a15bb9a91b |
13 | 64177ac3bc64 |
14 | 2b1d4067842b |
15 | 149755519c18 |
hex | a4bec48d5a7 |
11321203021223 has 4 divisors (see below), whose sum is σ = 11321314290720. Its totient is φ = 11321091751728.
The previous prime is 11321203021133. The next prime is 11321203021259. The reversal of 11321203021223 is 32212030212311.
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 11321203021223 - 228 = 11320934585767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321203029223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55481990 + ... + 55685667.
It is an arithmetic number, because the mean of its divisors is an integer number (2830328572680).
Almost surely, 211321203021223 is an apocalyptic number.
11321203021223 is a deficient number, since it is larger than the sum of its proper divisors (111269497).
11321203021223 is a wasteful number, since it uses less digits than its factorization.
11321203021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111269496.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11321203021223 its reverse (32212030212311), we get a palindrome (43533233233534).
The spelling of 11321203021223 in words is "eleven trillion, three hundred twenty-one billion, two hundred three million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •