Base | Representation |
---|---|
bin | 110011111000100111… |
… | …1000101010001110001 |
3 | 101122121011002212122211 |
4 | 1213301033011101301 |
5 | 3311142342221413 |
6 | 123104124132121 |
7 | 11023061441440 |
oct | 1476117052161 |
9 | 348534085584 |
10 | 111421445233 |
11 | 43287556a3a |
12 | 19716997041 |
13 | a678b46867 |
14 | 556dcb8d57 |
15 | 2d71cc683d |
hex | 19f13c5471 |
111421445233 has 8 divisors (see below), whose sum is σ = 128872997568. Its totient is φ = 94353443664.
The previous prime is 111421445231. The next prime is 111421445251. The reversal of 111421445233 is 332544124111.
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 111421445233 - 21 = 111421445231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111421445195 and 111421445204.
It is not an unprimeable number, because it can be changed into a prime (111421445231) 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 7 ways as a sum of consecutive naturals, for example, 95887066 + ... + 95888227.
It is an arithmetic number, because the mean of its divisors is an integer number (16109124696).
Almost surely, 2111421445233 is an apocalyptic number.
It is an amenable number.
111421445233 is a deficient number, since it is larger than the sum of its proper divisors (17451552335).
111421445233 is an equidigital number, since it uses as much as digits as its factorization.
111421445233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191775383.
The product of its digits is 11520, while the sum is 31.
Adding to 111421445233 its reverse (332544124111), we get a palindrome (443965569344).
The spelling of 111421445233 in words is "one hundred eleven billion, four hundred twenty-one million, four hundred forty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •