Base | Representation |
---|---|
bin | 1010000000011010000110… |
… | …0101001101001010110111 |
3 | 1102221210101210211001112122 |
4 | 2200012201211031022313 |
5 | 2420224321231130403 |
6 | 35222145524110155 |
7 | 2213606562040466 |
oct | 240064145151267 |
9 | 42853353731478 |
10 | 11002122130103 |
11 | 3561a79132745 |
12 | 129835053535b |
13 | 61a659c8ca40 |
14 | 2a07113429dd |
15 | 1412ccb43838 |
hex | a01a194d2b7 |
11002122130103 has 16 divisors (see below), whose sum is σ = 11852724612960. Its totient is φ = 10152132616704.
The previous prime is 11002122130073. The next prime is 11002122130127. The reversal of 11002122130103 is 30103122120011.
It is not a de Polignac number, because 11002122130103 - 28 = 11002122129847 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 (11002122130183) 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 15 ways as a sum of consecutive naturals, for example, 645921275 + ... + 645938307.
It is an arithmetic number, because the mean of its divisors is an integer number (740795288310).
Almost surely, 211002122130103 is an apocalyptic number.
11002122130103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11002122130103 is a deficient number, since it is larger than the sum of its proper divisors (850602482857).
11002122130103 is a wasteful number, since it uses less digits than its factorization.
11002122130103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32098.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11002122130103 its reverse (30103122120011), we get a palindrome (41105244250114).
The spelling of 11002122130103 in words is "eleven trillion, two billion, one hundred twenty-two million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •