Base | Representation |
---|---|
bin | 110001110110001000… |
… | …1110110011111110111 |
3 | 101020022000212221211010 |
4 | 1203230101312133313 |
5 | 3223211042132001 |
6 | 121101445443303 |
7 | 10506430121406 |
oct | 1435421663767 |
9 | 336260787733 |
10 | 107043317751 |
11 | 41440186a67 |
12 | 188b4710533 |
13 | a12baa1396 |
14 | 527665563d |
15 | 2bb775d8d6 |
hex | 18ec4767f7 |
107043317751 has 16 divisors (see below), whose sum is σ = 150252333440. Its totient is φ = 67599061920.
The previous prime is 107043317701. The next prime is 107043317761. The reversal of 107043317751 is 157713340701.
It is not a de Polignac number, because 107043317751 - 219 = 107042793463 is a prime.
It is a super-2 number, since 2×1070433177512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107043317701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 463521 + ... + 654933.
It is an arithmetic number, because the mean of its divisors is an integer number (9390770840).
Almost surely, 2107043317751 is an apocalyptic number.
107043317751 is a deficient number, since it is larger than the sum of its proper divisors (43209015689).
107043317751 is a wasteful number, since it uses less digits than its factorization.
107043317751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201246.
The product of its (nonzero) digits is 61740, while the sum is 39.
The spelling of 107043317751 in words is "one hundred seven billion, forty-three million, three hundred seventeen thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •