Base | Representation |
---|---|
bin | 10000001100101011110… |
… | …101101101100101101001 |
3 | 10221102012002022000201211 |
4 | 100030223311231211221 |
5 | 121214143244432223 |
6 | 2211211002313121 |
7 | 143264310100132 |
oct | 20145365554551 |
9 | 3842162260654 |
10 | 1113132030313 |
11 | 39a093014806 |
12 | 15b8957b87a1 |
13 | 80c77626904 |
14 | 3bc395a0c89 |
15 | 1de4d7d2d0d |
hex | 1032bd6d969 |
1113132030313 has 4 divisors (see below), whose sum is σ = 1113388694100. Its totient is φ = 1112875366528.
The previous prime is 1113132030259. The next prime is 1113132030341. The reversal of 1113132030313 is 3130302313111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 230719790889 + 882412239424 = 480333^2 + 939368^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113132030313 - 233 = 1104542095721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113132030113) 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, 128325388 + ... + 128334061.
It is an arithmetic number, because the mean of its divisors is an integer number (278347173525).
Almost surely, 21113132030313 is an apocalyptic number.
It is an amenable number.
1113132030313 is a deficient number, since it is larger than the sum of its proper divisors (256663787).
1113132030313 is an equidigital number, since it uses as much as digits as its factorization.
1113132030313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256663786.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1113132030313 its reverse (3130302313111), we get a palindrome (4243434343424).
The spelling of 1113132030313 in words is "one trillion, one hundred thirteen billion, one hundred thirty-two million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •