Base | Representation |
---|---|
bin | 110100101011110111… |
… | …1000101100011111001 |
3 | 101211000222221221122202 |
4 | 1221113233011203321 |
5 | 3323203111023113 |
6 | 123550514355545 |
7 | 11113512401366 |
oct | 1512757054371 |
9 | 354028857582 |
10 | 113141111033 |
11 | 43a8a231345 |
12 | 19b1688bbb5 |
13 | a8911ba3a2 |
14 | 569443d46d |
15 | 2e22c62258 |
hex | 1a57bc58f9 |
113141111033 has 8 divisors (see below), whose sum is σ = 114835901952. Its totient is φ = 111446500176.
The previous prime is 113141111011. The next prime is 113141111051. The reversal of 113141111033 is 330111141311.
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 113141111033 - 26 = 113141110969 is a prime.
It is a super-2 number, since 2×1131411110332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113141110996 and 113141111014.
It is not an unprimeable number, because it can be changed into a prime (113141111533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1756391 + ... + 1819667.
It is an arithmetic number, because the mean of its divisors is an integer number (14354487744).
Almost surely, 2113141111033 is an apocalyptic number.
It is an amenable number.
113141111033 is a deficient number, since it is larger than the sum of its proper divisors (1694790919).
113141111033 is an equidigital number, since it uses as much as digits as its factorization.
113141111033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90031.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 113141111033 its reverse (330111141311), we get a palindrome (443252252344).
The spelling of 113141111033 in words is "one hundred thirteen billion, one hundred forty-one million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •