Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …1100000111000011001101 |
3 | 1110100010010010011222121020 |
4 | 2201223011230013003031 |
5 | 2424011442114232341 |
6 | 35343524353424353 |
7 | 2224451454463023 |
oct | 241530554070315 |
9 | 43303103158536 |
10 | 11110102102221 |
11 | 35a3849aa6a21 |
12 | 12b526686b0b9 |
13 | 6278a7b1c575 |
14 | 2a5a36136713 |
15 | 143eec71e566 |
hex | a1ac5b070cd |
11110102102221 has 8 divisors (see below), whose sum is σ = 14813506792704. Its totient is φ = 7406716073280.
The previous prime is 11110102102219. The next prime is 11110102102273. The reversal of 11110102102221 is 12220120101111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11110102102221 - 21 = 11110102102219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110102102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110102102721) 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, 3211516 + ... + 5703861.
It is an arithmetic number, because the mean of its divisors is an integer number (1851688349088).
Almost surely, 211110102102221 is an apocalyptic number.
It is an amenable number.
11110102102221 is a deficient number, since it is larger than the sum of its proper divisors (3703404690483).
11110102102221 is an equidigital number, since it uses as much as digits as its factorization.
11110102102221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9330771.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11110102102221 its reverse (12220120101111), we get a palindrome (23330222203332).
The spelling of 11110102102221 in words is "eleven trillion, one hundred ten billion, one hundred two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •