Base | Representation |
---|---|
bin | 110100110000101000… |
… | …1111001111000111101 |
3 | 101211110011020222222212 |
4 | 1221201101321320331 |
5 | 3324020103430323 |
6 | 124014434350205 |
7 | 11120465410040 |
oct | 1514121717075 |
9 | 354404228885 |
10 | 113301233213 |
11 | 44061657523 |
12 | 19b6042b365 |
13 | a8b842163c |
14 | 56ab800c57 |
15 | 2e31d40b78 |
hex | 1a61479e3d |
113301233213 has 4 divisors (see below), whose sum is σ = 129487123680. Its totient is φ = 97115342748.
The previous prime is 113301233203. The next prime is 113301233263. The reversal of 113301233213 is 312332103311.
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 113301233213 - 214 = 113301216829 is a prime.
It is a super-2 number, since 2×1133012332132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113301233203) 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, 8092945223 + ... + 8092945236.
It is an arithmetic number, because the mean of its divisors is an integer number (32371780920).
Almost surely, 2113301233213 is an apocalyptic number.
It is an amenable number.
113301233213 is a deficient number, since it is larger than the sum of its proper divisors (16185890467).
113301233213 is an equidigital number, since it uses as much as digits as its factorization.
113301233213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16185890466.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 113301233213 its reverse (312332103311), we get a palindrome (425633336524).
The spelling of 113301233213 in words is "one hundred thirteen billion, three hundred one million, two hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •