Base | Representation |
---|---|
bin | 11010110001110011111010… |
… | …111100001101111001101101 |
3 | 120102222220200001011012212222 |
4 | 122301303322330031321231 |
5 | 110414034443104032101 |
6 | 1054251450301205125 |
7 | 33543522144105542 |
oct | 3261637274157155 |
9 | 512886601135788 |
10 | 117772213345901 |
11 | 34586a08133794 |
12 | 11261063b607a5 |
13 | 5093b44c0649a |
14 | 21122c4006bc9 |
15 | d937d3a8101b |
hex | 6b1cfaf0de6d |
117772213345901 has 2 divisors, whose sum is σ = 117772213345902. Its totient is φ = 117772213345900.
The previous prime is 117772213345879. The next prime is 117772213345981. The reversal of 117772213345901 is 109543312277711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86906955312100 + 30865258033801 = 9322390^2 + 5555651^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117772213345901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117772213345981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58886106672950 + 58886106672951.
It is an arithmetic number, because the mean of its divisors is an integer number (58886106672951).
Almost surely, 2117772213345901 is an apocalyptic number.
It is an amenable number.
117772213345901 is a deficient number, since it is larger than the sum of its proper divisors (1).
117772213345901 is an equidigital number, since it uses as much as digits as its factorization.
117772213345901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2222640, while the sum is 53.
The spelling of 117772213345901 in words is "one hundred seventeen trillion, seven hundred seventy-two billion, two hundred thirteen million, three hundred forty-five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •