Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1111100011111011101 |
3 | 100200012212220200101222 |
4 | 1132100003330133131 |
5 | 3124230001413432 |
6 | 114254032543125 |
7 | 10211601005402 |
oct | 1362003743735 |
9 | 320185820358 |
10 | 101201201117 |
11 | 39a124922a5 |
12 | 177440b1aa5 |
13 | 970a634833 |
14 | 4c807c42a9 |
15 | 2974911112 |
hex | 17900fc7dd |
101201201117 has 2 divisors, whose sum is σ = 101201201118. Its totient is φ = 101201201116.
The previous prime is 101201201113. The next prime is 101201201159. The reversal of 101201201117 is 711102102101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65774809156 + 35426391961 = 256466^2 + 188219^2 .
It is an emirp because it is prime and its reverse (711102102101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101201201117 - 22 = 101201201113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101201201095 and 101201201104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101201201113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600600558 + 50600600559.
It is an arithmetic number, because the mean of its divisors is an integer number (50600600559).
Almost surely, 2101201201117 is an apocalyptic number.
It is an amenable number.
101201201117 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201201117 is an equidigital number, since it uses as much as digits as its factorization.
101201201117 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 101201201117 its reverse (711102102101), we get a palindrome (812303303218).
The spelling of 101201201117 in words is "one hundred one billion, two hundred one million, two hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •