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

bin | 100010001011110011110000… |

… | …101110110100101101011000 |

3 | 201201022211220201011001220112 |

4 | 202023303300232310231120 |

5 | 124201223202423114134 |

6 | 1251431323514143452 |

7 | 43445034042516263 |

oct | 4213636056645530 |

9 | 651284821131815 |

10 | 150345074035544 |

11 | 439a4a95894603 |

12 | 14a41a71121b88 |

13 | 65b7630a2b26b |

14 | 291aa5197dcda |

15 | 125ac48ca31ce |

hex | 88bcf0bb4b58 |

150345074035544 has 8 divisors (see below), whose sum is σ = 281897013816660. Its totient is φ = 75172537017768.

The previous prime is 150345074035501. The next prime is 150345074035553. The reversal of 150345074035544 is 445530470543051.

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

It is a tau number, because it is divible by the number of its divisors (8).

It is a super-4 number, since 4×150345074035544^{4} (a number of 58 digits) contains 4444 as substring.

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 150345074035492 and 150345074035501.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9396567127214 + ... + 9396567127229.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 10080000, while the sum is 50.

The spelling of 150345074035544 in words is "one hundred fifty trillion, three hundred forty-five billion, seventy-four million, thirty-five thousand, five hundred forty-four".

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