Base | Representation |
---|---|
bin | 110110010011111100… |
… | …0010110101000010101 |
3 | 102011001100221111202121 |
4 | 1230213320112220111 |
5 | 3402331044414143 |
6 | 125325222135541 |
7 | 11266164565246 |
oct | 1544770265025 |
9 | 364040844677 |
10 | 116633201173 |
11 | 45511446355 |
12 | 1a7302815b1 |
13 | acc9817608 |
14 | 590613cccd |
15 | 307960a7ed |
hex | 1b27e16a15 |
116633201173 has 2 divisors, whose sum is σ = 116633201174. Its totient is φ = 116633201172.
The previous prime is 116633201131. The next prime is 116633201177. The reversal of 116633201173 is 371102336611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99466436689 + 17166764484 = 315383^2 + 131022^2 .
It is a cyclic number.
It is not a de Polignac number, because 116633201173 - 29 = 116633200661 is a prime.
It is a super-2 number, since 2×1166332011732 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116633201177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58316600586 + 58316600587.
It is an arithmetic number, because the mean of its divisors is an integer number (58316600587).
Almost surely, 2116633201173 is an apocalyptic number.
It is an amenable number.
116633201173 is a deficient number, since it is larger than the sum of its proper divisors (1).
116633201173 is an equidigital number, since it uses as much as digits as its factorization.
116633201173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
Adding to 116633201173 its reverse (371102336611), we get a palindrome (487735537784).
The spelling of 116633201173 in words is "one hundred sixteen billion, six hundred thirty-three million, two hundred one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •