Base | Representation |
---|---|
bin | 1010000001000000000101… |
… | …1011011111100000011111 |
3 | 1102222202201112011011222101 |
4 | 2200100001123133200133 |
5 | 2420411212423143403 |
6 | 35230553502425531 |
7 | 2214420362443024 |
oct | 240200133374037 |
9 | 42882645134871 |
10 | 11012320131103 |
11 | 3566331694845 |
12 | 129a3178922a7 |
13 | 61b5c39b4665 |
14 | 2a0ddb8c754b |
15 | 1416c80b371d |
hex | a04016df81f |
11012320131103 has 8 divisors (see below), whose sum is σ = 11021624951040. Its totient is φ = 11003016568320.
The previous prime is 11012320131083. The next prime is 11012320131157. The reversal of 11012320131103 is 30113102321011.
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-11012320131103 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 (11012320132103) 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, 17645058 + ... + 18258496.
It is an arithmetic number, because the mean of its divisors is an integer number (1377703118880).
Almost surely, 211012320131103 is an apocalyptic number.
11012320131103 is a deficient number, since it is larger than the sum of its proper divisors (9304819937).
11012320131103 is a wasteful number, since it uses less digits than its factorization.
11012320131103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628577.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11012320131103 its reverse (30113102321011), we get a palindrome (41125422452114).
The spelling of 11012320131103 in words is "eleven trillion, twelve billion, three hundred twenty million, one hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •