Base | Representation |
---|---|
bin | 11001101100101010000110… |
… | …010101000101001110011001 |
3 | 112211011121102201210221111002 |
4 | 121230222012111011032121 |
5 | 104303210001403202223 |
6 | 1040212403135514345 |
7 | 32543266350361460 |
oct | 3154520625051631 |
9 | 484147381727432 |
10 | 113020023100313 |
11 | 3301458268355a |
12 | 108140550889b5 |
13 | 4b0a9862065c4 |
14 | 1dca2ac2139d7 |
15 | d0ed9bc36e28 |
hex | 66ca86545399 |
113020023100313 has 4 divisors (see below), whose sum is σ = 129165740686080. Its totient is φ = 96874305514548.
The previous prime is 113020023100301. The next prime is 113020023100339. The reversal of 113020023100313 is 313001320020311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113020023100313 - 212 = 113020023096217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113020023100513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8072858792873 + ... + 8072858792886.
It is an arithmetic number, because the mean of its divisors is an integer number (32291435171520).
Almost surely, 2113020023100313 is an apocalyptic number.
It is an amenable number.
113020023100313 is a deficient number, since it is larger than the sum of its proper divisors (16145717585767).
113020023100313 is an equidigital number, since it uses as much as digits as its factorization.
113020023100313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16145717585766.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 113020023100313 its reverse (313001320020311), we get a palindrome (426021343120624).
The spelling of 113020023100313 in words is "one hundred thirteen trillion, twenty billion, twenty-three million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •