Base | Representation |
---|---|
bin | 1001001011111101111110… |
… | …1000101100111001000101 |
3 | 1022202200000101201011221222 |
4 | 2102333133220230321011 |
5 | 2310444244321223301 |
6 | 33252234135050125 |
7 | 2061534436122521 |
oct | 222773750547105 |
9 | 38680011634858 |
10 | 10101220101701 |
11 | 32449a3455633 |
12 | 1171826210945 |
13 | 583705679c21 |
14 | 26cc8a232d81 |
15 | 127b5133931b |
hex | 92fdfa2ce45 |
10101220101701 has 2 divisors, whose sum is σ = 10101220101702. Its totient is φ = 10101220101700.
The previous prime is 10101220101691. The next prime is 10101220101737. The reversal of 10101220101701 is 10710102210101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5638373724676 + 4462846377025 = 2374526^2 + 2112545^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10101220101701 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10101220101701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101220101901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050610050850 + 5050610050851.
It is an arithmetic number, because the mean of its divisors is an integer number (5050610050851).
Almost surely, 210101220101701 is an apocalyptic number.
It is an amenable number.
10101220101701 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101220101701 is an equidigital number, since it uses as much as digits as its factorization.
10101220101701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 10101220101701 its reverse (10710102210101), we get a palindrome (20811322311802).
The spelling of 10101220101701 in words is "ten trillion, one hundred one billion, two hundred twenty million, one hundred one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •