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

bin | 100010010001111… |

… | …111011000100101 |

3 | 1111002020012200211 |

4 | 202101333120211 |

5 | 2134214011123 |

6 | 133023135421 |

7 | 20152423060 |

oct | 4221773045 |

9 | 1432205624 |

10 | 575141413 |

11 | 27571a290 |

12 | 140744571 |

13 | 92203b82 |

14 | 565558d7 |

15 | 3575c40d |

hex | 2247f625 |

575141413 has 8 divisors (see below), whose sum is σ = 717059520. Its totient is φ = 448162080.

The previous prime is 575141389. The next prime is 575141423. The reversal of 575141413 is 314141575.

575141413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is not a de Polignac number, because 575141413 - 2^{9} = 575140901 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (575141423) 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, 3734608 + ... + 3734761.

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

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

It is an amenable number.

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

575141413 is a wasteful number, since it uses less digits than its factorization.

575141413 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 7469387.

The product of its digits is 8400, while the sum is 31.

The square root of 575141413 is about 23982.1061001739. The cubic root of 575141413 is about 831.6199132400.

Adding to 575141413 its reverse (314141575), we get a palindrome (889282988).

The spelling of 575141413 in words is "five hundred seventy-five million, one hundred forty-one thousand, four hundred thirteen".

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