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

bin | 110100100111011010… |

… | …000100111001100010 |

3 | 12101211021200001011012 |

4 | 310213122010321202 |

5 | 1411200401101312 |

6 | 41542003220522 |

7 | 4040005500002 |

oct | 644732047142 |

9 | 171737601135 |

10 | 56495722082 |

11 | 21a613a9208 |

12 | ab48377742 |

13 | 5434753667 |

14 | 2a3d300002 |

15 | 1709c9d322 |

hex | d27684e62 |

56495722082 has 6 divisors (see below), whose sum is σ = 84744087339. Its totient is φ = 28247692970.

The previous prime is 56495722067. The next prime is 56495722123. The reversal of 56495722082 is 28022759465.

Multipling 56495722082 by its sum of digits (50), we get a square (2824786104100 = 1680710^{2}).

It can be written as a sum of positive squares in only one way, i.e., 28247861041 + 28247861041 = 168071^2 + 168071^2 .

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

It is a super-2 number, since 2×56495722082^{2} (a number of 22 digits) contains 22 as substring.

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 56495722082.

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, 252107 + ... + 420177.

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

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

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

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

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

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

The spelling of 56495722082 in words is "fifty-six billion, four hundred ninety-five million, seven hundred twenty-two thousand, eighty-two".

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