Base | Representation |
---|---|
bin | 110011101100001000… |
… | …0010010101111010001 |
3 | 101121111221110201112200 |
4 | 1213120100102233101 |
5 | 3304313044111423 |
6 | 122554353113413 |
7 | 11006512153341 |
oct | 1473020225721 |
9 | 347457421480 |
10 | 111002332113 |
11 | 43091a17062 |
12 | 1961a558869 |
13 | a61007272a |
14 | 553037ad21 |
15 | 2d4a0d9d43 |
hex | 19d8412bd1 |
111002332113 has 6 divisors (see below), whose sum is σ = 160336701954. Its totient is φ = 74001554736.
The previous prime is 111002332079. The next prime is 111002332127. The reversal of 111002332113 is 311233200111.
It can be written as a sum of positive squares in only one way, i.e., 64774322064 + 46228010049 = 254508^2 + 215007^2 .
It is a de Polignac number, because none of the positive numbers 2k-111002332113 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (111002352113) 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 5 ways as a sum of consecutive naturals, for example, 6166796220 + ... + 6166796237.
It is an arithmetic number, because the mean of its divisors is an integer number (26722783659).
Almost surely, 2111002332113 is an apocalyptic number.
It is an amenable number.
111002332113 is a deficient number, since it is larger than the sum of its proper divisors (49334369841).
111002332113 is a wasteful number, since it uses less digits than its factorization.
111002332113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12333592463 (or 12333592460 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 111002332113 its reverse (311233200111), we get a palindrome (422235532224).
The spelling of 111002332113 in words is "one hundred eleven billion, two million, three hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •