Base | Representation |
---|---|
bin | 110011110000101100… |
… | …1001000001010010111 |
3 | 101121220121221201120211 |
4 | 1213201121020022113 |
5 | 3310121321034111 |
6 | 123021511110251 |
7 | 11013353243056 |
oct | 1474131101227 |
9 | 347817851524 |
10 | 111155643031 |
11 | 4316050a8a4 |
12 | 19661972387 |
13 | a635a60654 |
14 | 554688839d |
15 | 2d587c0521 |
hex | 19e1648297 |
111155643031 has 4 divisors (see below), whose sum is σ = 111201070752. Its totient is φ = 111110215312.
The previous prime is 111155642987. The next prime is 111155643037. The reversal of 111155643031 is 130346551111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111155643031 - 27 = 111155642903 is a prime.
It is a super-2 number, since 2×1111556430312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111155642984 and 111155643002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111155643037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22710190 + ... + 22715083.
It is an arithmetic number, because the mean of its divisors is an integer number (27800267688).
Almost surely, 2111155643031 is an apocalyptic number.
111155643031 is a deficient number, since it is larger than the sum of its proper divisors (45427721).
111155643031 is an equidigital number, since it uses as much as digits as its factorization.
111155643031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45427720.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 111155643031 in words is "one hundred eleven billion, one hundred fifty-five million, six hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •