Base | Representation |
---|---|
bin | 10011001101011100111… |
… | …000100110101001101111 |
3 | 11200012102222002001202222 |
4 | 103031130320212221233 |
5 | 133112043001132002 |
6 | 2450241321305555 |
7 | 164242431632234 |
oct | 23153470465157 |
9 | 4605388061688 |
10 | 1320113302127 |
11 | 4699475a8834 |
12 | 193a1b3352bb |
13 | 976420c2449 |
14 | 47c7292578b |
15 | 24514ac21a2 |
hex | 1335ce26a6f |
1320113302127 has 2 divisors, whose sum is σ = 1320113302128. Its totient is φ = 1320113302126.
The previous prime is 1320113302111. The next prime is 1320113302141. The reversal of 1320113302127 is 7212033110231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1320113302127 - 24 = 1320113302111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320113302096 and 1320113302105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320113302187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660056651063 + 660056651064.
It is an arithmetic number, because the mean of its divisors is an integer number (660056651064).
Almost surely, 21320113302127 is an apocalyptic number.
1320113302127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320113302127 is an equidigital number, since it uses as much as digits as its factorization.
1320113302127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 1320113302127 its reverse (7212033110231), we get a palindrome (8532146412358).
The spelling of 1320113302127 in words is "one trillion, three hundred twenty billion, one hundred thirteen million, three hundred two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •