Base | Representation |
---|---|
bin | 11111010010111111110… |
… | …11101110011010010001 |
3 | 10210210200002012220000201 |
4 | 33221133323232122101 |
5 | 120104304414103423 |
6 | 2142002022415201 |
7 | 140456131241254 |
oct | 17513773563221 |
9 | 3723602186021 |
10 | 1075351316113 |
11 | 385065868a68 |
12 | 1544b0b91501 |
13 | 7a536299019 |
14 | 3a093a5109b |
15 | 1ce8ba772ad |
hex | fa5feee691 |
1075351316113 has 2 divisors, whose sum is σ = 1075351316114. Its totient is φ = 1075351316112.
The previous prime is 1075351316111. The next prime is 1075351316119. The reversal of 1075351316113 is 3116131535701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 896719984209 + 178631331904 = 946953^2 + 422648^2 .
It is an emirp because it is prime and its reverse (3116131535701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1075351316113 - 21 = 1075351316111 is a prime.
It is a super-2 number, since 2×10753513161132 (a number of 25 digits) contains 22 as substring.
Together with 1075351316111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1075351316111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 537675658056 + 537675658057.
It is an arithmetic number, because the mean of its divisors is an integer number (537675658057).
Almost surely, 21075351316113 is an apocalyptic number.
It is an amenable number.
1075351316113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1075351316113 is an equidigital number, since it uses as much as digits as its factorization.
1075351316113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28350, while the sum is 37.
The spelling of 1075351316113 in words is "one trillion, seventy-five billion, three hundred fifty-one million, three hundred sixteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •