Base | Representation |
---|---|
bin | 1101010001011… |
… | …00011011100001 |
3 | 21202111012110220 |
4 | 12220230123201 |
5 | 212000043131 |
6 | 15014113253 |
7 | 2521204203 |
oct | 650543341 |
9 | 252435426 |
10 | 111331041 |
11 | 57930728 |
12 | 3134b829 |
13 | 1a0b0173 |
14 | 10b00773 |
15 | 9b91e96 |
hex | 6a2c6e1 |
111331041 has 8 divisors (see below), whose sum is σ = 148547040. Its totient is φ = 74167872.
The previous prime is 111331037. The next prime is 111331057. The reversal of 111331041 is 140133111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111331041 - 22 = 111331037 is a prime.
It is a super-3 number, since 3×1113310413 (a number of 25 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111331041.
It is not an unprimeable number, because it can be changed into a prime (111331061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7995 + ... + 16928.
It is an arithmetic number, because the mean of its divisors is an integer number (18568380).
Almost surely, 2111331041 is an apocalyptic number.
It is an amenable number.
111331041 is a deficient number, since it is larger than the sum of its proper divisors (37215999).
111331041 is a wasteful number, since it uses less digits than its factorization.
111331041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26415.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 111331041 is about 10551.3525673252. The cubic root of 111331041 is about 481.0668415055.
Adding to 111331041 its reverse (140133111), we get a palindrome (251464152).
The spelling of 111331041 in words is "one hundred eleven million, three hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •