Base | Representation |
---|---|
bin | 110010111111101… |
… | …001011011010101 |
3 | 2012121212012212111 |
4 | 302333221123111 |
5 | 3223004424212 |
6 | 220521151021 |
7 | 30126005626 |
oct | 6277513325 |
9 | 2177765774 |
10 | 855545557 |
11 | 3a9a2a049 |
12 | 1ba62b471 |
13 | 108330499 |
14 | 818a7a4d |
15 | 50199ea7 |
hex | 32fe96d5 |
855545557 has 12 divisors (see below), whose sum is σ = 886464964. Its totient is φ = 825477120.
The previous prime is 855545549. The next prime is 855545573. The reversal of 855545557 is 755545558.
It can be written as a sum of positive squares in 6 ways, for example, as 19236996 + 836308561 = 4386^2 + 28919^2 .
It is not a de Polignac number, because 855545557 - 23 = 855545549 is a prime.
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 855545557.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (855545597) 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 11 ways as a sum of consecutive naturals, for example, 168853 + ... + 173845.
Almost surely, 2855545557 is an apocalyptic number.
It is an amenable number.
855545557 is a deficient number, since it is larger than the sum of its proper divisors (30919407).
855545557 is an equidigital number, since it uses as much as digits as its factorization.
855545557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5160 (or 5107 counting only the distinct ones).
The product of its digits is 3500000, while the sum is 49.
The square root of 855545557 is about 29249.7103746345. The cubic root of 855545557 is about 949.3238242845.
Subtracting from 855545557 its reverse (755545558), we obtain a palindrome (99999999).
The spelling of 855545557 in words is "eight hundred fifty-five million, five hundred forty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •