Base | Representation |
---|---|
bin | 110001111000101011… |
… | …0000101001101111111 |
3 | 101020111221211010222022 |
4 | 1203301112011031333 |
5 | 3223344322001303 |
6 | 121114123310355 |
7 | 10511511430166 |
oct | 1436126051577 |
9 | 336457733868 |
10 | 107128312703 |
11 | 41484159a25 |
12 | 1891907b3bb |
13 | a143590159 |
14 | 5283a5c3dd |
15 | 2bbee4c438 |
hex | 18f158537f |
107128312703 has 4 divisors (see below), whose sum is σ = 107129138088. Its totient is φ = 107127487320.
The previous prime is 107128312691. The next prime is 107128312751. The reversal of 107128312703 is 307213821701.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 307213821701 = 19927 ⋅15416963.
It is a cyclic number.
It is not a de Polignac number, because 107128312703 - 26 = 107128312639 is a prime.
It is a super-2 number, since 2×1071283127032 (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 (107128312783) 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, 170708 + ... + 493353.
It is an arithmetic number, because the mean of its divisors is an integer number (26782284522).
Almost surely, 2107128312703 is an apocalyptic number.
107128312703 is a deficient number, since it is larger than the sum of its proper divisors (825385).
107128312703 is an equidigital number, since it uses as much as digits as its factorization.
107128312703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825384.
The product of its (nonzero) digits is 14112, while the sum is 35.
The spelling of 107128312703 in words is "one hundred seven billion, one hundred twenty-eight million, three hundred twelve thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •