Base | Representation |
---|---|
bin | 110011110010101001… |
… | …0011100101110100001 |
3 | 101122002011221021000211 |
4 | 1213211102130232201 |
5 | 3310240034013441 |
6 | 123032204014121 |
7 | 11015105624326 |
oct | 1474522345641 |
9 | 348064837024 |
10 | 111221001121 |
11 | 431943a034a |
12 | 1967b831341 |
13 | a646465389 |
14 | 555141cb4d |
15 | 2d5e3d0a81 |
hex | 19e549cba1 |
111221001121 has 2 divisors, whose sum is σ = 111221001122. Its totient is φ = 111221001120.
The previous prime is 111221001109. The next prime is 111221001149. The reversal of 111221001121 is 121100122111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110266500096 + 954501025 = 332064^2 + 30895^2 .
It is a cyclic number.
It is not a de Polignac number, because 111221001121 - 231 = 109073517473 is a prime.
It is a super-2 number, since 2×1112210011212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111221002121) 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 as a sum of consecutive naturals, namely, 55610500560 + 55610500561.
It is an arithmetic number, because the mean of its divisors is an integer number (55610500561).
Almost surely, 2111221001121 is an apocalyptic number.
It is an amenable number.
111221001121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111221001121 is an equidigital number, since it uses as much as digits as its factorization.
111221001121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111221001121 its reverse (121100122111), we get a palindrome (232321123232).
The spelling of 111221001121 in words is "one hundred eleven billion, two hundred twenty-one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •