Base | Representation |
---|---|
bin | 10100111001101011… |
… | …01011010010011011 |
3 | 1001222000202121212022 |
4 | 22130311223102123 |
5 | 140440120014402 |
6 | 5053250205055 |
7 | 545034030104 |
oct | 123465532233 |
9 | 31860677768 |
10 | 11221251227 |
11 | 483911614a |
12 | 2211b8378b |
13 | 109aa12734 |
14 | 7864253ab |
15 | 45a1e52a2 |
hex | 29cd6b49b |
11221251227 has 4 divisors (see below), whose sum is σ = 11221624536. Its totient is φ = 11220877920.
The previous prime is 11221251199. The next prime is 11221251263. The reversal of 11221251227 is 72215212211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72215212211 = 401 ⋅180087811.
It is a cyclic number.
It is not a de Polignac number, because 11221251227 - 228 = 10952815771 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11221251196 and 11221251205.
It is not an unprimeable number, because it can be changed into a prime (11221251127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 137198 + ... + 203139.
It is an arithmetic number, because the mean of its divisors is an integer number (2805406134).
Almost surely, 211221251227 is an apocalyptic number.
11221251227 is a deficient number, since it is larger than the sum of its proper divisors (373309).
11221251227 is an equidigital number, since it uses as much as digits as its factorization.
11221251227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373308.
The product of its digits is 1120, while the sum is 26.
Adding to 11221251227 its reverse (72215212211), we get a palindrome (83436463438).
The spelling of 11221251227 in words is "eleven billion, two hundred twenty-one million, two hundred fifty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •