Base | Representation |
---|---|
bin | 11001110011111101101110… |
… | …110101100010110011100110 |
3 | 112212221121111010120221020022 |
4 | 121303331232311202303212 |
5 | 104334421320333134114 |
6 | 1041235203510235142 |
7 | 32624463313614662 |
oct | 3163755665426346 |
9 | 485847433527208 |
10 | 113522140130534 |
11 | 33198518651103 |
12 | 10895427055ab2 |
13 | 4b46126b25985 |
14 | 20067026778a2 |
15 | d1ce8864848e |
hex | 673f6ed62ce6 |
113522140130534 has 4 divisors (see below), whose sum is σ = 170283210195804. Its totient is φ = 56761070065266.
The previous prime is 113522140130437. The next prime is 113522140130537. The reversal of 113522140130534 is 435031041225311.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 113522140130494 and 113522140130503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113522140130537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28380535032632 + ... + 28380535032635.
It is an arithmetic number, because the mean of its divisors is an integer number (42570802548951).
Almost surely, 2113522140130534 is an apocalyptic number.
113522140130534 is a deficient number, since it is larger than the sum of its proper divisors (56761070065270).
113522140130534 is an equidigital number, since it uses as much as digits as its factorization.
113522140130534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56761070065269.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 113522140130534 its reverse (435031041225311), we get a palindrome (548553181355845).
The spelling of 113522140130534 in words is "one hundred thirteen trillion, five hundred twenty-two billion, one hundred forty million, one hundred thirty thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.247 sec. • engine limits •