Base | Representation |
---|---|
bin | 11001101101110111101000… |
… | …101000011100101110101001 |
3 | 112211110120022211012011220012 |
4 | 121231313220220130232221 |
5 | 104311041002320114423 |
6 | 1040314532241541305 |
7 | 32552304430450025 |
oct | 3155675050345651 |
9 | 484416284164805 |
10 | 113103276723113 |
11 | 330469151285a6 |
12 | 1082820a644835 |
13 | 4b157934332c1 |
14 | 1dd0329135385 |
15 | d12120b97078 |
hex | 66dde8a1cba9 |
113103276723113 has 8 divisors (see below), whose sum is σ = 119759406101640. Its totient is φ = 106447480172800.
The previous prime is 113103276723109. The next prime is 113103276723187. The reversal of 113103276723113 is 311327672301311.
It can be written as a sum of positive squares in 4 ways, for example, as 1098561823129 + 112004714899984 = 1048123^2 + 10583228^2 .
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 113103276723113 - 22 = 113103276723109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113103276723313) 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, 82507238 + ... + 83866863.
It is an arithmetic number, because the mean of its divisors is an integer number (14969925762705).
Almost surely, 2113103276723113 is an apocalyptic number.
It is an amenable number.
113103276723113 is a deficient number, since it is larger than the sum of its proper divisors (6656129378527).
113103276723113 is a wasteful number, since it uses less digits than its factorization.
113103276723113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166414107.
The product of its (nonzero) digits is 95256, while the sum is 41.
The spelling of 113103276723113 in words is "one hundred thirteen trillion, one hundred three billion, two hundred seventy-six million, seven hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •