Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …1100100100000011001001 |
3 | 1110100010010010102000112111 |
4 | 2201223011230210003021 |
5 | 2424011442132033001 |
6 | 35343524400142321 |
7 | 2224451455466230 |
oct | 241530554440311 |
9 | 43303103360474 |
10 | 11110102221001 |
11 | 35a384a078193 |
12 | 12b52669079a1 |
13 | 6278a7b61654 |
14 | 2a5a36167b17 |
15 | 143eec744851 |
hex | a1ac5b240c9 |
11110102221001 has 8 divisors (see below), whose sum is σ = 12701624523840. Its totient is φ = 9519671128848.
The previous prime is 11110102220929. The next prime is 11110102221013. The reversal of 11110102221001 is 10012220101111.
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 11110102221001 - 229 = 11109565350089 is a prime.
It is a super-2 number, since 2×111101022210012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11110102221041) 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, 272780851 + ... + 272821576.
It is an arithmetic number, because the mean of its divisors is an integer number (1587703065480).
Almost surely, 211110102221001 is an apocalyptic number.
It is an amenable number.
11110102221001 is a deficient number, since it is larger than the sum of its proper divisors (1591522302839).
11110102221001 is an equidigital number, since it uses as much as digits as its factorization.
11110102221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545605343.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11110102221001 its reverse (10012220101111), we get a palindrome (21122322322112).
The spelling of 11110102221001 in words is "eleven trillion, one hundred ten billion, one hundred two million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •