Base | Representation |
---|---|
bin | 10011001101011100000… |
… | …110010010101110111101 |
3 | 11200012102001021000011102 |
4 | 103031130012102232331 |
5 | 133112031112111331 |
6 | 2450240130502445 |
7 | 164242211552042 |
oct | 23153406225675 |
9 | 4605361230142 |
10 | 1320100113341 |
11 | 46994010a909 |
12 | 193a16a34a25 |
13 | 9763c455329 |
14 | 47c70c911c9 |
15 | 245138694cb |
hex | 1335c192bbd |
1320100113341 has 2 divisors, whose sum is σ = 1320100113342. Its totient is φ = 1320100113340.
The previous prime is 1320100113329. The next prime is 1320100113361. The reversal of 1320100113341 is 1433110010231.
It is an a-pointer prime, because the next prime (1320100113361) can be obtained adding 1320100113341 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1296286994116 + 23813119225 = 1138546^2 + 154315^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320100113341 - 238 = 1045222206397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320100113361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660050056670 + 660050056671.
It is an arithmetic number, because the mean of its divisors is an integer number (660050056671).
Almost surely, 21320100113341 is an apocalyptic number.
It is an amenable number.
1320100113341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320100113341 is an equidigital number, since it uses as much as digits as its factorization.
1320100113341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1320100113341 its reverse (1433110010231), we get a palindrome (2753210123572).
The spelling of 1320100113341 in words is "one trillion, three hundred twenty billion, one hundred million, one hundred thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •