Base | Representation |
---|---|
bin | 10100101100011010… |
… | …10010101001000101 |
3 | 1001200021102112112201 |
4 | 22112031102221011 |
5 | 140223130014341 |
6 | 5034233514501 |
7 | 542213311054 |
oct | 122615225105 |
9 | 31607375481 |
10 | 11110001221 |
11 | 47913403a0 |
12 | 21a0872a31 |
13 | 1080960427 |
14 | 77574639b |
15 | 45056c331 |
hex | 296352a45 |
11110001221 has 4 divisors (see below), whose sum is σ = 12120001344. Its totient is φ = 10100001100.
The previous prime is 11110001207. The next prime is 11110001237. The reversal of 11110001221 is 12210001111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11110001221 - 213 = 11109993029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110001198 and 11110001207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110701221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505000045 + ... + 505000066.
It is an arithmetic number, because the mean of its divisors is an integer number (3030000336).
Almost surely, 211110001221 is an apocalyptic number.
11110001221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11110001221 is a deficient number, since it is larger than the sum of its proper divisors (1010000123).
11110001221 is a wasteful number, since it uses less digits than its factorization.
11110001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010000122.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11110001221 its reverse (12210001111), we get a palindrome (23320002332).
The spelling of 11110001221 in words is "eleven billion, one hundred ten million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •