Base | Representation |
---|---|
bin | 1101001111101… |
… | …11111110000001 |
3 | 21202002021201101 |
4 | 12213313332001 |
5 | 211421204121 |
6 | 15005334401 |
7 | 2516320552 |
oct | 647677601 |
9 | 252067641 |
10 | 111116161 |
11 | 577a4242 |
12 | 31267401 |
13 | 1a036410 |
14 | 10a86329 |
15 | 9b4d491 |
hex | 69f7f81 |
111116161 has 12 divisors (see below), whose sum is σ = 126298452. Its totient is φ = 97166304.
The previous prime is 111116153. The next prime is 111116189. The reversal of 111116161 is 161611111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 29322225 + 81793936 = 5415^2 + 9044^2 .
It is not a de Polignac number, because 111116161 - 23 = 111116153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111116561) 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 11 ways as a sum of consecutive naturals, for example, 7146 + ... + 16531.
It is an arithmetic number, because the mean of its divisors is an integer number (10524871).
Almost surely, 2111116161 is an apocalyptic number.
It is an amenable number.
111116161 is a deficient number, since it is larger than the sum of its proper divisors (15182291).
111116161 is a wasteful number, since it uses less digits than its factorization.
111116161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23728 (or 23709 counting only the distinct ones).
The product of its digits is 36, while the sum is 19.
The square root of 111116161 is about 10541.1650684353. The cubic root of 111116161 is about 480.7571398589.
Adding to 111116161 its reverse (161611111), we get a palindrome (272727272).
The spelling of 111116161 in words is "one hundred eleven million, one hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •