Base | Representation |
---|---|
bin | 100111010001010… |
… | …0111001001100101 |
3 | 10101211110220020022 |
4 | 1032202213021211 |
5 | 10144312233401 |
6 | 334430444525 |
7 | 44440142411 |
oct | 11642471145 |
9 | 3354426208 |
10 | 1317696101 |
11 | 616894647 |
12 | 309363745 |
13 | 17ccc2847 |
14 | c7009d41 |
15 | 7aa3871b |
hex | 4e8a7265 |
1317696101 has 2 divisors, whose sum is σ = 1317696102. Its totient is φ = 1317696100.
The previous prime is 1317696097. The next prime is 1317696103. The reversal of 1317696101 is 1016967131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 848323876 + 469372225 = 29126^2 + 21665^2 .
It is an emirp because it is prime and its reverse (1016967131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1317696101 - 22 = 1317696097 is a prime.
Together with 1317696103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1317696103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 658848050 + 658848051.
It is an arithmetic number, because the mean of its divisors is an integer number (658848051).
Almost surely, 21317696101 is an apocalyptic number.
It is an amenable number.
1317696101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1317696101 is an equidigital number, since it uses as much as digits as its factorization.
1317696101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 35.
The square root of 1317696101 is about 36300.0840357154. The cubic root of 1317696101 is about 1096.3227347665.
The spelling of 1317696101 in words is "one billion, three hundred seventeen million, six hundred ninety-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •