Base | Representation |
---|---|
bin | 1010000011010000010101… |
… | …1011110010011110011001 |
3 | 1110010110200010020010012121 |
4 | 2200310011123302132121 |
5 | 2422030013224221241 |
6 | 35300440103141241 |
7 | 2220261060213046 |
oct | 240640533623631 |
9 | 43113603203177 |
10 | 11051042023321 |
11 | 35807a2138563 |
12 | 12a5923744821 |
13 | 622155025711 |
14 | 2a2c324321cd |
15 | 1426e2781ad1 |
hex | a0d056f2799 |
11051042023321 has 8 divisors (see below), whose sum is σ = 11080033965000. Its totient is φ = 11022053072640.
The previous prime is 11051042023297. The next prime is 11051042023363. The reversal of 11051042023321 is 12332024015011.
It can be written as a sum of positive squares in 4 ways, for example, as 2227290592921 + 8823751430400 = 1492411^2 + 2970480^2 .
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 11051042023321 - 27 = 11051042023193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11051042623321) 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, 6749931 + ... + 8225791.
It is an arithmetic number, because the mean of its divisors is an integer number (1385004245625).
Almost surely, 211051042023321 is an apocalyptic number.
It is an amenable number.
11051042023321 is a deficient number, since it is larger than the sum of its proper divisors (28991941679).
11051042023321 is a wasteful number, since it uses less digits than its factorization.
11051042023321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495499.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 11051042023321 its reverse (12332024015011), we get a palindrome (23383066038332).
The spelling of 11051042023321 in words is "eleven trillion, fifty-one billion, forty-two million, twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •