Base | Representation |
---|---|
bin | 10000011100011001011… |
… | …100001100011010010001 |
3 | 11000000201212102021021022 |
4 | 100130121130030122101 |
5 | 122003221311020423 |
6 | 2223041042405225 |
7 | 144432350614325 |
oct | 20343134143221 |
9 | 4000655367238 |
10 | 1130003220113 |
11 | 3a62603a4379 |
12 | 163003960815 |
13 | 82735a29c61 |
14 | 3c99a10d985 |
15 | 1e5d9a13dc8 |
hex | 1071970c691 |
1130003220113 has 2 divisors, whose sum is σ = 1130003220114. Its totient is φ = 1130003220112.
The previous prime is 1130003220107. The next prime is 1130003220173. The reversal of 1130003220113 is 3110223000311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1127903472784 + 2099747329 = 1062028^2 + 45823^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130003220113 - 228 = 1129734784657 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1130003220091 and 1130003220100.
It is not a weakly prime, because it can be changed into another prime (1130003220103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565001610056 + 565001610057.
It is an arithmetic number, because the mean of its divisors is an integer number (565001610057).
Almost surely, 21130003220113 is an apocalyptic number.
It is an amenable number.
1130003220113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130003220113 is an equidigital number, since it uses as much as digits as its factorization.
1130003220113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1130003220113 its reverse (3110223000311), we get a palindrome (4240226220424).
The spelling of 1130003220113 in words is "one trillion, one hundred thirty billion, three million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •