Base | Representation |
---|---|
bin | 110010000101011001… |
… | …1000010011110010101 |
3 | 101021121201100002010021 |
4 | 1210022303002132111 |
5 | 3230233131142122 |
6 | 121224340025141 |
7 | 10525215153304 |
oct | 1441263023625 |
9 | 337551302107 |
10 | 107555334037 |
11 | 41683200418 |
12 | 18a180921b1 |
13 | a1b0ba29b8 |
14 | 52c465843b |
15 | 2be769c1c7 |
hex | 190acc2795 |
107555334037 has 2 divisors, whose sum is σ = 107555334038. Its totient is φ = 107555334036.
The previous prime is 107555333999. The next prime is 107555334043. The reversal of 107555334037 is 730433555701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86458933521 + 21096400516 = 294039^2 + 145246^2 .
It is a cyclic number.
It is not a de Polignac number, because 107555334037 - 231 = 105407850389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 107555333984 and 107555334002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107555304037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53777667018 + 53777667019.
It is an arithmetic number, because the mean of its divisors is an integer number (53777667019).
Almost surely, 2107555334037 is an apocalyptic number.
It is an amenable number.
107555334037 is a deficient number, since it is larger than the sum of its proper divisors (1).
107555334037 is an equidigital number, since it uses as much as digits as its factorization.
107555334037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 661500, while the sum is 43.
Adding to 107555334037 its reverse (730433555701), we get a palindrome (837988889738).
The spelling of 107555334037 in words is "one hundred seven billion, five hundred fifty-five million, three hundred thirty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •