Base | Representation |
---|---|
bin | 110100101011100100… |
… | …1000011011110110001 |
3 | 101211000022012102101210 |
4 | 1221113021003132301 |
5 | 3323143033003131 |
6 | 123545520550333 |
7 | 11113331555352 |
oct | 1512711033661 |
9 | 354008172353 |
10 | 113131141041 |
11 | 43a84641786 |
12 | 19b134823a9 |
13 | a88c109399 |
14 | 5692da5d29 |
15 | 2e21e43146 |
hex | 1a572437b1 |
113131141041 has 8 divisors (see below), whose sum is σ = 156042953280. Its totient is φ = 72820044752.
The previous prime is 113131140979. The next prime is 113131141073. The reversal of 113131141041 is 140141131311.
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 113131141041 - 26 = 113131140977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113131140999 and 113131141017.
It is not an unprimeable number, because it can be changed into a prime (113131141091) 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, 650178885 + ... + 650179058.
It is an arithmetic number, because the mean of its divisors is an integer number (19505369160).
Almost surely, 2113131141041 is an apocalyptic number.
It is an amenable number.
113131141041 is a deficient number, since it is larger than the sum of its proper divisors (42911812239).
113131141041 is a wasteful number, since it uses less digits than its factorization.
113131141041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1300357975.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 113131141041 its reverse (140141131311), we get a palindrome (253272272352).
The spelling of 113131141041 in words is "one hundred thirteen billion, one hundred thirty-one million, one hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •