Base | Representation |
---|---|
bin | 110010000101011101… |
… | …0001110001101100001 |
3 | 101021121211212202020010 |
4 | 1210022322032031201 |
5 | 3230234121421441 |
6 | 121224444235133 |
7 | 10525240155324 |
oct | 1441272161541 |
9 | 337554782203 |
10 | 107557217121 |
11 | 41684277192 |
12 | 18a1883baa9 |
13 | a1b13b1b53 |
14 | 52c49c87bb |
15 | 2be7920116 |
hex | 190ae8e361 |
107557217121 has 4 divisors (see below), whose sum is σ = 143409622832. Its totient is φ = 71704811412.
The previous prime is 107557217113. The next prime is 107557217143. The reversal of 107557217121 is 121712755701.
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 not a de Polignac number, because 107557217121 - 23 = 107557217113 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 107557217121.
It is not an unprimeable number, because it can be changed into a prime (107557216121) 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, 17926202851 + ... + 17926202856.
It is an arithmetic number, because the mean of its divisors is an integer number (35852405708).
Almost surely, 2107557217121 is an apocalyptic number.
It is an amenable number.
107557217121 is a deficient number, since it is larger than the sum of its proper divisors (35852405711).
107557217121 is an equidigital number, since it uses as much as digits as its factorization.
107557217121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35852405710.
The product of its (nonzero) digits is 34300, while the sum is 39.
The spelling of 107557217121 in words is "one hundred seven billion, five hundred fifty-seven million, two hundred seventeen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •