Base | Representation |
---|---|
bin | 11000111011000110000… |
… | …00101001110100111001 |
3 | 10000212102011200110012001 |
4 | 30131203000221310321 |
5 | 103012311024420414 |
6 | 1453223422221001 |
7 | 115604250363562 |
oct | 14354300516471 |
9 | 3025364613161 |
10 | 856359607609 |
11 | 3001a8745100 |
12 | 119b75124761 |
13 | 629a645340c |
14 | 2d63b553169 |
15 | 17421155074 |
hex | c763029d39 |
856359607609 has 9 divisors (see below), whose sum is σ = 941299022181. Its totient is φ = 778499480220.
The previous prime is 856359607559. The next prime is 856359607661. The reversal of 856359607609 is 906706953658.
The square root of 856359607609 is 925397.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 856359607609 - 211 = 856359605561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (856359607669) 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 8 ways as a sum of consecutive naturals, for example, 10137304 + ... + 10221430.
Almost surely, 2856359607609 is an apocalyptic number.
856359607609 is the 925397-th square number.
856359607609 is the 462699-th centered octagonal number.
It is an amenable number.
856359607609 is a deficient number, since it is larger than the sum of its proper divisors (84939414572).
856359607609 is an frugal number, since it uses more digits than its factorization.
856359607609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168276 (or 84138 counting only the distinct ones).
The product of its (nonzero) digits is 73483200, while the sum is 64.
Multiplying 856359607609 by its sum of digits (64), we get a square (54807014886976 = 74031762).
The spelling of 856359607609 in words is "eight hundred fifty-six billion, three hundred fifty-nine million, six hundred seven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •