Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0100101011110001001111 |
3 | 1110101002020022200210221022 |
4 | 2201310200310223301033 |
5 | 2424143203034323043 |
6 | 35352320425024355 |
7 | 2225260305002615 |
oct | 241644064536117 |
9 | 43332208623838 |
10 | 11120221011023 |
11 | 35a8071947973 |
12 | 12b720b6250bb |
13 | 62882b341077 |
14 | 2a6315dad6b5 |
15 | 1443e0c69868 |
hex | a1d20d2bc4f |
11120221011023 has 8 divisors (see below), whose sum is σ = 11141791065216. Its totient is φ = 11098651824000.
The previous prime is 11120221010993. The next prime is 11120221011037. The reversal of 11120221011023 is 32011012202111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120221011023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120221010992 and 11120221011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120221011623) 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, 29359298 + ... + 29735648.
It is an arithmetic number, because the mean of its divisors is an integer number (1392723883152).
Almost surely, 211120221011023 is an apocalyptic number.
11120221011023 is a deficient number, since it is larger than the sum of its proper divisors (21570054193).
11120221011023 is an equidigital number, since it uses as much as digits as its factorization.
11120221011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433585.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11120221011023 its reverse (32011012202111), we get a palindrome (43131233213134).
The spelling of 11120221011023 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •