Base | Representation |
---|---|
bin | 110011110110101011… |
… | …0100100101100001001 |
3 | 101122102121112011020221 |
4 | 1213231112210230021 |
5 | 3311024203100131 |
6 | 123053435550041 |
7 | 11021340634660 |
oct | 1475526445411 |
9 | 348377464227 |
10 | 111356300041 |
11 | 43253801438 |
12 | 196b8bbb321 |
13 | a6684b79cc |
14 | 556539bdd7 |
15 | 2d6b209411 |
hex | 19ed5a4b09 |
111356300041 has 8 divisors (see below), whose sum is σ = 131369644544. Its totient is φ = 92369280960.
The previous prime is 111356300023. The next prime is 111356300051. The reversal of 111356300041 is 140003653111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111356300041 - 211 = 111356297993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111356299979 and 111356300015.
It is not an unprimeable number, because it can be changed into a prime (111356300051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 256581120 + ... + 256581553.
It is an arithmetic number, because the mean of its divisors is an integer number (16421205568).
Almost surely, 2111356300041 is an apocalyptic number.
It is an amenable number.
111356300041 is a deficient number, since it is larger than the sum of its proper divisors (20013344503).
111356300041 is an equidigital number, since it uses as much as digits as its factorization.
111356300041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513162711.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 111356300041 its reverse (140003653111), we get a palindrome (251359953152).
The spelling of 111356300041 in words is "one hundred eleven billion, three hundred fifty-six million, three hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •