Base | Representation |
---|---|
bin | 110010000100100110… |
… | …1111100010101110101 |
3 | 101021112212110122200011 |
4 | 1210021031330111311 |
5 | 3230204340113443 |
6 | 121221552020221 |
7 | 10524443665054 |
oct | 1441115742565 |
9 | 337485418604 |
10 | 107528832373 |
11 | 4166a24a316 |
12 | 18a0b231671 |
13 | a1a8554141 |
14 | 52c0d1a39b |
15 | 2be51b4b9d |
hex | 190937c575 |
107528832373 has 2 divisors, whose sum is σ = 107528832374. Its totient is φ = 107528832372.
The previous prime is 107528832371. The next prime is 107528832469. The reversal of 107528832373 is 373238825701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87697715044 + 19831117329 = 296138^2 + 140823^2 .
It is a cyclic number.
It is not a de Polignac number, because 107528832373 - 21 = 107528832371 is a prime.
It is a super-2 number, since 2×1075288323732 (a number of 23 digits) contains 22 as substring.
Together with 107528832371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107528832371) 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, 53764416186 + 53764416187.
It is an arithmetic number, because the mean of its divisors is an integer number (53764416187).
Almost surely, 2107528832373 is an apocalyptic number.
It is an amenable number.
107528832373 is a deficient number, since it is larger than the sum of its proper divisors (1).
107528832373 is an equidigital number, since it uses as much as digits as its factorization.
107528832373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1693440, while the sum is 49.
The spelling of 107528832373 in words is "one hundred seven billion, five hundred twenty-eight million, eight hundred thirty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •