Base | Representation |
---|---|
bin | 1010010101111100001101… |
… | …0100001000011101100101 |
3 | 1111021011021002021112110112 |
4 | 2211133003110020131211 |
5 | 2442304432122022143 |
6 | 40104130003102405 |
7 | 2252414062603136 |
oct | 245370324103545 |
9 | 44234232245415 |
10 | 11372055267173 |
11 | 3694952802997 |
12 | 1337b92371a05 |
13 | 6464c3425313 |
14 | 2b45a6253c8d |
15 | 14ac2eb06e18 |
hex | a57c3508765 |
11372055267173 has 2 divisors, whose sum is σ = 11372055267174. Its totient is φ = 11372055267172.
The previous prime is 11372055267151. The next prime is 11372055267187. The reversal of 11372055267173 is 37176255027311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7404238271329 + 3967816995844 = 2721073^2 + 1991938^2 .
It is a cyclic number.
It is not a de Polignac number, because 11372055267173 - 212 = 11372055263077 is a prime.
It is a super-2 number, since 2×113720552671732 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11372055261173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5686027633586 + 5686027633587.
It is an arithmetic number, because the mean of its divisors is an integer number (5686027633587).
Almost surely, 211372055267173 is an apocalyptic number.
It is an amenable number.
11372055267173 is a deficient number, since it is larger than the sum of its proper divisors (1).
11372055267173 is an equidigital number, since it uses as much as digits as its factorization.
11372055267173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1852200, while the sum is 50.
The spelling of 11372055267173 in words is "eleven trillion, three hundred seventy-two billion, fifty-five million, two hundred sixty-seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •