Base | Representation |
---|---|
bin | 110010001010110011… |
… | …1000000010111110001 |
3 | 101022002100122220022221 |
4 | 1210111213000113301 |
5 | 3231121100312243 |
6 | 121254340001041 |
7 | 10532550041641 |
oct | 1442547002761 |
9 | 338070586287 |
10 | 107736729073 |
11 | 41766636176 |
12 | 18a68990181 |
13 | a20c64483c |
14 | 5300796521 |
15 | 2c0857dbed |
hex | 19159c05f1 |
107736729073 has 4 divisors (see below), whose sum is σ = 107853962560. Its totient is φ = 107619495588.
The previous prime is 107736729043. The next prime is 107736729091. The reversal of 107736729073 is 370927637701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 107736729073 - 25 = 107736729041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107736729073.
It is not an unprimeable number, because it can be changed into a prime (107736729013) 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 in 3 ways as a sum of consecutive naturals, for example, 58615365 + ... + 58617202.
It is an arithmetic number, because the mean of its divisors is an integer number (26963490640).
Almost surely, 2107736729073 is an apocalyptic number.
It is an amenable number.
107736729073 is a deficient number, since it is larger than the sum of its proper divisors (117233487).
107736729073 is an equidigital number, since it uses as much as digits as its factorization.
107736729073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117233486.
The product of its (nonzero) digits is 2333772, while the sum is 52.
The spelling of 107736729073 in words is "one hundred seven billion, seven hundred thirty-six million, seven hundred twenty-nine thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •