Base | Representation |
---|---|
bin | 110011101111111101… |
… | …1111101100011111111 |
3 | 101121211220222220210101 |
4 | 1213133323331203333 |
5 | 3310044043021343 |
6 | 123015235421531 |
7 | 11012635533412 |
oct | 1473773754377 |
9 | 347756886711 |
10 | 111131220223 |
11 | 43148749661 |
12 | 196557548a7 |
13 | a63098c09a |
14 | 554352bb79 |
15 | 2d56598e4d |
hex | 19dfefd8ff |
111131220223 has 4 divisors (see below), whose sum is σ = 111137695920. Its totient is φ = 111124744528.
The previous prime is 111131220203. The next prime is 111131220271. The reversal of 111131220223 is 322022131111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111131220223 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111131220223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111131220203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3212038 + ... + 3246451.
It is an arithmetic number, because the mean of its divisors is an integer number (27784423980).
Almost surely, 2111131220223 is an apocalyptic number.
111131220223 is a deficient number, since it is larger than the sum of its proper divisors (6475697).
111131220223 is an equidigital number, since it uses as much as digits as its factorization.
111131220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6475696.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111131220223 its reverse (322022131111), we get a palindrome (433153351334).
The spelling of 111131220223 in words is "one hundred eleven billion, one hundred thirty-one million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •