Base | Representation |
---|---|
bin | 1010000010110111010011… |
… | …0010001001001111011011 |
3 | 1110002211022122222010200121 |
4 | 2200231310302021033123 |
5 | 2421422231434020443 |
6 | 35253405103414111 |
7 | 2216632356634141 |
oct | 240556462111733 |
9 | 43084278863617 |
10 | 11044320220123 |
11 | 3578962926303 |
12 | 12a45685b4337 |
13 | 621623555488 |
14 | 2a2795811591 |
15 | 14244c5bb4ed |
hex | a0b74c893db |
11044320220123 has 8 divisors (see below), whose sum is σ = 11076356987136. Its totient is φ = 11012324980800.
The previous prime is 11044320220121. The next prime is 11044320220127. The reversal of 11044320220123 is 32102202344011.
11044320220123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11044320220123 - 21 = 11044320220121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11044320220121) 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, 9849211 + ... + 10913092.
It is an arithmetic number, because the mean of its divisors is an integer number (1384544623392).
Almost surely, 211044320220123 is an apocalyptic number.
11044320220123 is a deficient number, since it is larger than the sum of its proper divisors (32036767013).
11044320220123 is a wasteful number, since it uses less digits than its factorization.
11044320220123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20763845.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 11044320220123 its reverse (32102202344011), we get a palindrome (43146522564134).
The spelling of 11044320220123 in words is "eleven trillion, forty-four billion, three hundred twenty million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •