Base | Representation |
---|---|
bin | 11001101101110110011101… |
… | …001100000110100010110101 |
3 | 112211110110001121111211120220 |
4 | 121231312131030012202311 |
5 | 104311030404304013023 |
6 | 1040314202505044553 |
7 | 32552231161133106 |
oct | 3155663514064265 |
9 | 484413047454526 |
10 | 113102011001013 |
11 | 33046325712881 |
12 | 10827b16786759 |
13 | 4b1562113a508 |
14 | 1dd0248db83ad |
15 | d120999c83e3 |
hex | 66dd9d3068b5 |
113102011001013 has 8 divisors (see below), whose sum is σ = 154011249022848. Its totient is φ = 73797056823264.
The previous prime is 113102011001009. The next prime is 113102011001039. The reversal of 113102011001013 is 310100110201311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113102011001013 - 22 = 113102011001009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113102011000983 and 113102011001001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113102011001003) 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, 401070960856 + ... + 401070961137.
It is an arithmetic number, because the mean of its divisors is an integer number (19251406127856).
Almost surely, 2113102011001013 is an apocalyptic number.
It is an amenable number.
113102011001013 is a deficient number, since it is larger than the sum of its proper divisors (40909238021835).
113102011001013 is an equidigital number, since it uses as much as digits as its factorization.
113102011001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802141922043.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 113102011001013 its reverse (310100110201311), we get a palindrome (423202121202324).
The spelling of 113102011001013 in words is "one hundred thirteen trillion, one hundred two billion, eleven million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •