Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …110000011101100111101 |
3 | 10221010101121222212111222 |
4 | 100021313312003230331 |
5 | 121142002212101023 |
6 | 2205551205323125 |
7 | 143126421124244 |
oct | 20116766035475 |
9 | 3833347885458 |
10 | 1110112222013 |
11 | 398883455073 |
12 | 15b1924064a5 |
13 | 808b5ac82b2 |
14 | 3ba304bd95b |
15 | 1dd23629cc8 |
hex | 10277d83b3d |
1110112222013 has 8 divisors (see below), whose sum is σ = 1137095836032. Its totient is φ = 1083268783296.
The previous prime is 1110112221983. The next prime is 1110112222033. The reversal of 1110112222013 is 3102222110111.
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 1110112222013 - 222 = 1110108027709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110112221982 and 1110112222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110112222033) 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, 35027795 + ... + 35059472.
It is an arithmetic number, because the mean of its divisors is an integer number (142136979504).
Almost surely, 21110112222013 is an apocalyptic number.
It is an amenable number.
1110112222013 is a deficient number, since it is larger than the sum of its proper divisors (26983614019).
1110112222013 is an equidigital number, since it uses as much as digits as its factorization.
1110112222013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70087651.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1110112222013 its reverse (3102222110111), we get a palindrome (4212334332124).
The spelling of 1110112222013 in words is "one trillion, one hundred ten billion, one hundred twelve million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •