Base | Representation |
---|---|
bin | 10000001010111001111… |
… | …100100011001010101101 |
3 | 10221020020220202210202222 |
4 | 100022321330203022231 |
5 | 121201240113020023 |
6 | 2210253223125125 |
7 | 143166045344462 |
oct | 20127174431255 |
9 | 3836226683688 |
10 | 1111221220013 |
11 | 3992a2455743 |
12 | 15b4418a37a5 |
13 | 80a317a9728 |
14 | 3bad78c1669 |
15 | 1dd8ab8bcc8 |
hex | 102b9f232ad |
1111221220013 has 8 divisors (see below), whose sum is σ = 1118920716000. Its totient is φ = 1103524946128.
The previous prime is 1111221220003. The next prime is 1111221220033. The reversal of 1111221220013 is 3100221221111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111221220013 - 26 = 1111221219949 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1111221219973 and 1111221220000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111221220003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111323 + ... + 1494936.
It is an arithmetic number, because the mean of its divisors is an integer number (139865089500).
Almost surely, 21111221220013 is an apocalyptic number.
It is an amenable number.
1111221220013 is a deficient number, since it is larger than the sum of its proper divisors (7699495987).
1111221220013 is a wasteful number, since it uses less digits than its factorization.
1111221220013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1611051.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1111221220013 its reverse (3100221221111), we get a palindrome (4211442441124).
The spelling of 1111221220013 in words is "one trillion, one hundred eleven billion, two hundred twenty-one million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •