Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …1100101100110001000011 |
3 | 1102221210100111001101201021 |
4 | 2200012200130230301003 |
5 | 2420224301344414021 |
6 | 35222144004450311 |
7 | 2213606241345310 |
oct | 240064034546103 |
9 | 42853314041637 |
10 | 11002103123011 |
11 | 3561a69430400 |
12 | 12983460a9997 |
13 | 61a656066540 |
14 | 2a070c9d5d07 |
15 | 1412cb13bc41 |
hex | a01a072cc43 |
11002103123011 has 48 divisors (see below), whose sum is σ = 15023068123392. Its totient is φ = 7839640923840.
The previous prime is 11002103123009. The next prime is 11002103123017. The reversal of 11002103123011 is 11032130120011.
It is a happy number.
It is not a de Polignac number, because 11002103123011 - 21 = 11002103123009 is a prime.
It is a super-2 number, since 2×110021031230112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11002103123017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3490945 + ... + 5847298.
It is an arithmetic number, because the mean of its divisors is an integer number (312980585904).
Almost surely, 211002103123011 is an apocalyptic number.
11002103123011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11002103123011 is a deficient number, since it is larger than the sum of its proper divisors (4020965000381).
11002103123011 is a wasteful number, since it uses less digits than its factorization.
11002103123011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9338392 (or 9338381 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11002103123011 its reverse (11032130120011), we get a palindrome (22034233243022).
The spelling of 11002103123011 in words is "eleven trillion, two billion, one hundred three million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •