Base | Representation |
---|---|

bin | 1100100001111… |

… | …00000010111111 |

3 | 21022202210222010 |

4 | 12100330002333 |

5 | 203401303201 |

6 | 14232422303 |

7 | 2414236230 |

oct | 620740277 |

9 | 238683863 |

10 | 105103551 |

11 | 54367943 |

12 | 2b247993 |

13 | 18a0c767 |

14 | dd5d087 |

15 | 9361bd6 |

hex | 643c0bf |

105103551 has 8 divisors (see below), whose sum is σ = 160157824. Its totient is φ = 60059160.

The previous prime is 105103543. The next prime is 105103553. The reversal of 105103551 is 155301501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 105103551 - 2^{3} = 105103543 is a prime.

It is a super-2 number, since 2×105103551^{2} = 22093512865619202, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5004931 = 105103551 / (1 + 0 + 5 + 1 + 0 + 3 + 5 + 5 + 1).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105103553) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2502445 + ... + 2502486.

It is an arithmetic number, because the mean of its divisors is an integer number (20019728).

Almost surely, 2^{105103551} is an apocalyptic number.

105103551 is a deficient number, since it is larger than the sum of its proper divisors (55054273).

105103551 is an equidigital number, since it uses as much as digits as its factorization.

105103551 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 5004941.

The product of its (nonzero) digits is 375, while the sum is 21.

The square root of 105103551 is about 10252.0022922354. The cubic root of 105103551 is about 471.9244334043.

The spelling of 105103551 in words is "one hundred five million, one hundred three thousand, five hundred fifty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.058 sec. • engine limits •