Base | Representation |
---|---|
bin | 11101001000101000111… |
… | …01101110101100000101 |
3 | 10112200221100011112001012 |
4 | 32210110131232230011 |
5 | 112400143100431301 |
6 | 2043515135412005 |
7 | 132216315462665 |
oct | 16442435565405 |
9 | 3480840145035 |
10 | 1001070717701 |
11 | 35660835aa5a |
12 | 142020684005 |
13 | 73529066102 |
14 | 366487221a5 |
15 | 1b090765ebb |
hex | e91476eb05 |
1001070717701 has 2 divisors, whose sum is σ = 1001070717702. Its totient is φ = 1001070717700.
The previous prime is 1001070717667. The next prime is 1001070717733. The reversal of 1001070717701 is 1077170701001.
1001070717701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (1001070717733) can be obtained adding 1001070717701 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 818664849601 + 182405868100 = 904801^2 + 427090^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001070717701 - 210 = 1001070716677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001070717761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500535358850 + 500535358851.
It is an arithmetic number, because the mean of its divisors is an integer number (500535358851).
Almost surely, 21001070717701 is an apocalyptic number.
It is an amenable number.
1001070717701 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001070717701 is an equidigital number, since it uses as much as digits as its factorization.
1001070717701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2401, while the sum is 32.
The spelling of 1001070717701 in words is "one trillion, one billion, seventy million, seven hundred seventeen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •