Base | Representation |
---|---|
bin | 1010000000011010000101… |
… | …1101001010010001101111 |
3 | 1102221210101122211220112112 |
4 | 2200012201131022101233 |
5 | 2420224320211133403 |
6 | 35222145410554235 |
7 | 2213606535105011 |
oct | 240064135122157 |
9 | 42853348756475 |
10 | 11002120021103 |
11 | 3561a77a22172 |
12 | 129834b89897b |
13 | 61a659701b03 |
14 | 2a0710d541b1 |
15 | 1412cc8789d8 |
hex | a01a174a46f |
11002120021103 has 8 divisors (see below), whose sum is σ = 11007571292928. Its totient is φ = 10996669976344.
The previous prime is 11002120021091. The next prime is 11002120021127. The reversal of 11002120021103 is 30112002120011.
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-11002120021103 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 (11002120021133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17896676 + ... + 18501222.
It is an arithmetic number, because the mean of its divisors is an integer number (1375946411616).
Almost surely, 211002120021103 is an apocalyptic number.
11002120021103 is a deficient number, since it is larger than the sum of its proper divisors (5451271825).
11002120021103 is an equidigital number, since it uses as much as digits as its factorization.
11002120021103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613533.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11002120021103 its reverse (30112002120011), we get a palindrome (41114122141114).
The spelling of 11002120021103 in words is "eleven trillion, two billion, one hundred twenty million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •