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

bin | 1011010011110010010… |

… | …1111000011000000010 |

3 | 200120111102002021120122 |

4 | 2310330211320120002 |

5 | 11140401230412042 |

6 | 225131114540242 |

7 | 20015455346342 |

oct | 2647445703002 |

9 | 616442067518 |

10 | 194290091522 |

11 | 7544176747a |

12 | 317a3437682 |

13 | 154243921c7 |

14 | 9591a26d22 |

15 | 50c203e7d2 |

hex | 2d3c978602 |

194290091522 has 6 divisors (see below), whose sum is σ = 291436072329. Its totient is φ = 97144734080.

The previous prime is 194290091507. The next prime is 194290091537. The reversal of 194290091522 is 225190092491.

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

It is an interprime number because it is at equal distance from previous prime (194290091507) and next prime (194290091537).

It can be written as a sum of positive squares in 2 ways, for example, as 111369705841 + 82920385681 = 333721^2 + 287959^2 .

It is an ABA number since it can be written as A⋅B^{A}, here for A=2, B=311681.

It is a Duffinian number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 467522 + ... + 779202.

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

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

194290091522 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 116640, while the sum is 44.

The spelling of 194290091522 in words is "one hundred ninety-four billion, two hundred ninety million, ninety-one thousand, five hundred twenty-two".

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