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

bin | 11001001100010110… |

… | …11101011000110111 |

3 | 1021220121111112201021 |

4 | 30212023131120313 |

5 | 210200003040210 |

6 | 10114041042011 |

7 | 656113225561 |

oct | 144613353067 |

9 | 37817445637 |

10 | 13525440055 |

11 | 5810838336 |

12 | 2755786307 |

13 | 13771c338a |

14 | 924464331 |

15 | 542642bda |

hex | 3262dd637 |

13525440055 has 8 divisors (see below), whose sum is σ = 16236266112. Its totient is φ = 10816526688.

The previous prime is 13525440041. The next prime is 13525440059. The reversal of 13525440055 is 55004452531.

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 13525440055 - 2^{11} = 13525438007 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 13525440055.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

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

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

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

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

The sum of its prime factors is 956345.

The product of its (nonzero) digits is 60000, while the sum is 34.

Adding to 13525440055 its reverse (55004452531), we get a palindrome (68529892586).

The spelling of 13525440055 in words is "thirteen billion, five hundred twenty-five million, four hundred forty thousand, fifty-five".

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