Base | Representation |
---|---|
bin | 10000001100110001101… |
… | …100101010111000001101 |
3 | 10221102102221020211020121 |
4 | 100030301230222320031 |
5 | 121214343430320323 |
6 | 2211224433144541 |
7 | 143266612422301 |
oct | 20146154527015 |
9 | 3842387224217 |
10 | 1113230323213 |
11 | 39a13354a708 |
12 | 15b9026bb151 |
13 | 80c91ac03a8 |
14 | 3bc48669d01 |
15 | 1de5724ba5d |
hex | 10331b2ae0d |
1113230323213 has 8 divisors (see below), whose sum is σ = 1134463016088. Its totient is φ = 1092006087744.
The previous prime is 1113230323207. The next prime is 1113230323267. The reversal of 1113230323213 is 3123230323111.
It can be written as a sum of positive squares in 4 ways, for example, as 727742074084 + 385488249129 = 853078^2 + 620877^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1113230323213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113230323013) 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, 1848270 + ... + 2375407.
It is an arithmetic number, because the mean of its divisors is an integer number (141807877011).
Almost surely, 21113230323213 is an apocalyptic number.
It is an amenable number.
1113230323213 is a deficient number, since it is larger than the sum of its proper divisors (21232692875).
1113230323213 is an equidigital number, since it uses as much as digits as its factorization.
1113230323213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4228703.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1113230323213 its reverse (3123230323111), we get a palindrome (4236460646324).
The spelling of 1113230323213 in words is "one trillion, one hundred thirteen billion, two hundred thirty million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •