Base | Representation |
---|---|
bin | 110001111000111100… |
… | …1111111111000000001 |
3 | 101020112121112111100001 |
4 | 1203301321333320001 |
5 | 3223404224244001 |
6 | 121115101200001 |
7 | 10511654443063 |
oct | 1436171777001 |
9 | 336477474301 |
10 | 107137728001 |
11 | 414894aa867 |
12 | 18920260001 |
13 | a145508835 |
14 | 5284dcd733 |
15 | 2bc0bac001 |
hex | 18f1e7fe01 |
107137728001 has 4 divisors (see below), whose sum is σ = 111795890112. Its totient is φ = 102479565892.
The previous prime is 107137727993. The next prime is 107137728011. The reversal of 107137728001 is 100827731701.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100827731701 = 7759 ⋅12994939.
It is a cyclic number.
It is not a de Polignac number, because 107137728001 - 23 = 107137727993 is a prime.
It is a super-2 number, since 2×1071377280012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107137728011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2329081021 + ... + 2329081066.
It is an arithmetic number, because the mean of its divisors is an integer number (27948972528).
Almost surely, 2107137728001 is an apocalyptic number.
It is an amenable number.
107137728001 is a deficient number, since it is larger than the sum of its proper divisors (4658162111).
107137728001 is an equidigital number, since it uses as much as digits as its factorization.
107137728001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4658162110.
The product of its (nonzero) digits is 16464, while the sum is 37.
The spelling of 107137728001 in words is "one hundred seven billion, one hundred thirty-seven million, seven hundred twenty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •