Base | Representation |
---|---|
bin | 10011001010100000100… |
… | …101100100110010000111 |
3 | 11122220021210122220102002 |
4 | 103022200211210302013 |
5 | 133034110233302002 |
6 | 2445000030535515 |
7 | 164101231655462 |
oct | 23124045446207 |
9 | 4586253586362 |
10 | 1316954197127 |
11 | 468576347458 |
12 | 19329936759b |
13 | 9725a77194a |
14 | 47a531442d9 |
15 | 243cc5a1002 |
hex | 132a0964c87 |
1316954197127 has 2 divisors, whose sum is σ = 1316954197128. Its totient is φ = 1316954197126.
The previous prime is 1316954197103. The next prime is 1316954197171. The reversal of 1316954197127 is 7217914596131.
It is a weak prime.
It is an emirp because it is prime and its reverse (7217914596131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1316954197127 - 26 = 1316954197063 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1316951197127) 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, 658477098563 + 658477098564.
It is an arithmetic number, because the mean of its divisors is an integer number (658477098564).
Almost surely, 21316954197127 is an apocalyptic number.
1316954197127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1316954197127 is an equidigital number, since it uses as much as digits as its factorization.
1316954197127 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2857680, while the sum is 56.
The spelling of 1316954197127 in words is "one trillion, three hundred sixteen billion, nine hundred fifty-four million, one hundred ninety-seven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •