Base | Representation |
---|---|
bin | 110100101101101000… |
… | …0011111111001100001 |
3 | 101211012010011001021122 |
4 | 1221123100133321201 |
5 | 3323313222420223 |
6 | 124000425102025 |
7 | 11115130556303 |
oct | 1513320377141 |
9 | 354163131248 |
10 | 113200201313 |
11 | 4400a620791 |
12 | 19b32627915 |
13 | a8a0509254 |
14 | 569c221973 |
15 | 2e280355c8 |
hex | 1a5b41fe61 |
113200201313 has 8 divisors (see below), whose sum is σ = 114261239400. Its totient is φ = 112139572608.
The previous prime is 113200201291. The next prime is 113200201319. The reversal of 113200201313 is 313102002311.
It can be written as a sum of positive squares in 4 ways, for example, as 63972573184 + 49227628129 = 252928^2 + 221873^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 113200201313 - 26 = 113200201249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113200201291 and 113200201300.
It is not an unprimeable number, because it can be changed into a prime (113200201319) 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, 468095 + ... + 667467.
It is an arithmetic number, because the mean of its divisors is an integer number (14282654925).
Almost surely, 2113200201313 is an apocalyptic number.
It is an amenable number.
113200201313 is a deficient number, since it is larger than the sum of its proper divisors (1061038087).
113200201313 is a wasteful number, since it uses less digits than its factorization.
113200201313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204691.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113200201313 its reverse (313102002311), we get a palindrome (426302203624).
The spelling of 113200201313 in words is "one hundred thirteen billion, two hundred million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •