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

bin | 11010110001110011… |

… | …00010110110110011 |

3 | 1101002220200212102222 |

4 | 31120321202312303 |

5 | 213420323210000 |

6 | 10334315431255 |

7 | 1016155141532 |

oct | 153071426663 |

9 | 41086625388 |

10 | 14376381875 |

11 | 6108102539 |

12 | 295275552b |

13 | 14815a124b |

14 | 9a5490319 |

15 | 5921cda85 |

hex | 358e62db3 |

14376381875 has 20 divisors (see below), whose sum is σ = 18055158000. Its totient is φ = 11443212000.

The previous prime is 14376381871. The next prime is 14376381889. The reversal of 14376381875 is 57818367341.

It is not a de Polignac number, because 14376381875 - 2^{2} = 14376381871 is a prime.

It is a hoax number, since the sum of its digits (53) coincides with the sum of the digits of its distinct prime factors.

It is not an unprimeable number, because it can be changed into a prime (14376381871) 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 19 ways as a sum of consecutive naturals, for example, 66581 + ... + 182169.

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

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

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

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

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

The sum of its prime factors is 115808 (or 115793 counting only the distinct ones).

The product of its digits is 3386880, while the sum is 53.

The spelling of 14376381875 in words is "fourteen billion, three hundred seventy-six million, three hundred eighty-one thousand, eight hundred seventy-five".

Divisors: 1 5 25 125 199 625 995 4975 24875 115589 124375 577945 2889725 14448625 23002211 72243125 115011055 575055275 2875276375 14376381875

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