Base | Representation |
---|---|
bin | 10011001101011100001… |
… | …101011111011000011101 |
3 | 11200012102011210212101111 |
4 | 103031130031133120131 |
5 | 133112032103001112 |
6 | 2450240235142021 |
7 | 164242233601003 |
oct | 23153415373035 |
9 | 4605364725344 |
10 | 1320102000157 |
11 | 469941189466 |
12 | 193a175a4911 |
13 | 9763c9660a5 |
14 | 47c71222a73 |
15 | 24513add5a7 |
hex | 1335c35f61d |
1320102000157 has 2 divisors, whose sum is σ = 1320102000158. Its totient is φ = 1320102000156.
The previous prime is 1320102000053. The next prime is 1320102000163. The reversal of 1320102000157 is 7510002010231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1308996844996 + 11105155161 = 1144114^2 + 105381^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320102000157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320102000167) 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, 660051000078 + 660051000079.
It is an arithmetic number, because the mean of its divisors is an integer number (660051000079).
Almost surely, 21320102000157 is an apocalyptic number.
It is an amenable number.
1320102000157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320102000157 is an equidigital number, since it uses as much as digits as its factorization.
1320102000157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 22.
Adding to 1320102000157 its reverse (7510002010231), we get a palindrome (8830104010388).
The spelling of 1320102000157 in words is "one trillion, three hundred twenty billion, one hundred two million, one hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •