Base | Representation |
---|---|
bin | 110100101000010000… |
… | …1100101101010101101 |
3 | 101210201120022120122022 |
4 | 1221100201211222231 |
5 | 3322431123211023 |
6 | 123530513355525 |
7 | 11110513162025 |
oct | 1512041455255 |
9 | 353646276568 |
10 | 113020132013 |
11 | 43a27a10a88 |
12 | 19aa2268ba5 |
13 | a87210c979 |
14 | 568234aa85 |
15 | 2e173167c8 |
hex | 1a50865aad |
113020132013 has 8 divisors (see below), whose sum is σ = 115157707776. Its totient is φ = 110882746000.
The previous prime is 113020131997. The next prime is 113020132073. The reversal of 113020132013 is 310231020311.
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 113020132013 - 24 = 113020131997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113020131982 and 113020132000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113020132073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1914488 + ... + 1972638.
It is an arithmetic number, because the mean of its divisors is an integer number (14394713472).
Almost surely, 2113020132013 is an apocalyptic number.
It is an amenable number.
113020132013 is a deficient number, since it is larger than the sum of its proper divisors (2137575763).
113020132013 is an equidigital number, since it uses as much as digits as its factorization.
113020132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94875.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113020132013 its reverse (310231020311), we get a palindrome (423251152324).
The spelling of 113020132013 in words is "one hundred thirteen billion, twenty million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •