Base | Representation |
---|---|
bin | 11000111101001110010100… |
… | …000110101011001101111101 |
3 | 112101121222201012000002212222 |
4 | 120331032110012223031331 |
5 | 103341303221222332013 |
6 | 1025235115243335125 |
7 | 32055632250410054 |
oct | 3075162406531575 |
9 | 471558635002788 |
10 | 109760374027133 |
11 | 31a78127767095 |
12 | 103883672214a5 |
13 | 493248854937b |
14 | 1d1660521539b |
15 | ca51bc539508 |
hex | 63d3941ab37d |
109760374027133 has 2 divisors, whose sum is σ = 109760374027134. Its totient is φ = 109760374027132.
The previous prime is 109760374027103. The next prime is 109760374027201. The reversal of 109760374027133 is 331720473067901.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59089922878009 + 50670451149124 = 7686997^2 + 7118318^2 .
It is a cyclic number.
It is not a de Polignac number, because 109760374027133 - 218 = 109760373764989 is a prime.
It is a super-2 number, since 2×1097603740271332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109760374027103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54880187013566 + 54880187013567.
It is an arithmetic number, because the mean of its divisors is an integer number (54880187013567).
Almost surely, 2109760374027133 is an apocalyptic number.
It is an amenable number.
109760374027133 is a deficient number, since it is larger than the sum of its proper divisors (1).
109760374027133 is an equidigital number, since it uses as much as digits as its factorization.
109760374027133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4000752, while the sum is 53.
The spelling of 109760374027133 in words is "one hundred nine trillion, seven hundred sixty billion, three hundred seventy-four million, twenty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •