Base | Representation |
---|---|
bin | 110100101110000001… |
… | …0100000100101100011 |
3 | 101211020000211002211212 |
4 | 1221130002200211203 |
5 | 3323330101430311 |
6 | 124002014100335 |
7 | 11115350161031 |
oct | 1513402404543 |
9 | 354200732755 |
10 | 113213311331 |
11 | 44016a6550a |
12 | 19b36aaa6ab |
13 | a8a3149563 |
14 | 569dc75551 |
15 | 2e29274c8b |
hex | 1a5c0a0963 |
113213311331 has 4 divisors (see below), whose sum is σ = 116865353664. Its totient is φ = 109561269000.
The previous prime is 113213311313. The next prime is 113213311339. The reversal of 113213311331 is 133113312311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113213311331 is a prime.
It is a super-2 number, since 2×1132133113312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113213311297 and 113213311306.
It is not an unprimeable number, because it can be changed into a prime (113213311339) 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, 1826021120 + ... + 1826021181.
It is an arithmetic number, because the mean of its divisors is an integer number (29216338416).
Almost surely, 2113213311331 is an apocalyptic number.
113213311331 is a deficient number, since it is larger than the sum of its proper divisors (3652042333).
113213311331 is an equidigital number, since it uses as much as digits as its factorization.
113213311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3652042332.
The product of its digits is 486, while the sum is 23.
Adding to 113213311331 its reverse (133113312311), we get a palindrome (246326623642).
The spelling of 113213311331 in words is "one hundred thirteen billion, two hundred thirteen million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •