Base | Representation |
---|---|
bin | 110001111001001110… |
… | …0010111100001001011 |
3 | 101020120020111020101001 |
4 | 1203302130113201023 |
5 | 3223414031101424 |
6 | 121120022235431 |
7 | 10512124146406 |
oct | 1436234274113 |
9 | 336506436331 |
10 | 107146737739 |
11 | 414935a3a28 |
12 | 18923285b77 |
13 | a147341742 |
14 | 5286296d3d |
15 | 2bc188b844 |
hex | 18f271784b |
107146737739 has 4 divisors (see below), whose sum is σ = 107313374056. Its totient is φ = 106980101424.
The previous prime is 107146737727. The next prime is 107146737781. The reversal of 107146737739 is 937737641701.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 107146737739 - 211 = 107146735691 is a prime.
It is a super-2 number, since 2×1071467377392 (a number of 23 digits) contains 22 as substring.
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 107146737739.
It is not an unprimeable number, because it can be changed into a prime (107146732739) 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 in 3 ways as a sum of consecutive naturals, for example, 83317194 + ... + 83318479.
It is an arithmetic number, because the mean of its divisors is an integer number (26828343514).
Almost surely, 2107146737739 is an apocalyptic number.
107146737739 is a deficient number, since it is larger than the sum of its proper divisors (166636317).
107146737739 is an equidigital number, since it uses as much as digits as its factorization.
107146737739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166636316.
The product of its (nonzero) digits is 4667544, while the sum is 55.
The spelling of 107146737739 in words is "one hundred seven billion, one hundred forty-six million, seven hundred thirty-seven thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •