Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1001101101101100000101 |
3 | 1110101001201101100100112020 |
4 | 2201310110321231230011 |
5 | 2424142300334044023 |
6 | 35352244522113353 |
7 | 2225252325653106 |
oct | 241642471555405 |
9 | 43331641310466 |
10 | 11120021003013 |
11 | 35a7a79a5999a |
12 | 12b717464b859 |
13 | 6287c8a83230 |
14 | 2a62d75c83ad |
15 | 1443cd40cde3 |
hex | a1d14e6db05 |
11120021003013 has 16 divisors (see below), whose sum is σ = 15972512773056. Its totient is φ = 6840817079040.
The previous prime is 11120021002973. The next prime is 11120021003041. The reversal of 11120021003013 is 31030012002111.
It is a happy number.
It is not a de Polignac number, because 11120021003013 - 221 = 11120018905861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120021002983 and 11120021003001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120021003083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47230420 + ... + 47465277.
It is an arithmetic number, because the mean of its divisors is an integer number (998282048316).
Almost surely, 211120021003013 is an apocalyptic number.
11120021003013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11120021003013 is a deficient number, since it is larger than the sum of its proper divisors (4852491770043).
11120021003013 is a wasteful number, since it uses less digits than its factorization.
11120021003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94698724.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11120021003013 its reverse (31030012002111), we get a palindrome (42150033005124).
The spelling of 11120021003013 in words is "eleven trillion, one hundred twenty billion, twenty-one million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •