Base | Representation |
---|---|
bin | 110101000101000011… |
… | …110011010000101011 |
3 | 12110002221202111101200 |
4 | 311011003303100223 |
5 | 1413210224333042 |
6 | 42103214015243 |
7 | 4055226125313 |
oct | 650503632053 |
9 | 173087674350 |
10 | 56993199147 |
11 | 221971a2085 |
12 | b066aa7523 |
13 | 54b38342a1 |
14 | 2a893da443 |
15 | 17387b8c4c |
hex | d450f342b |
56993199147 has 12 divisors (see below), whose sum is σ = 83092889880. Its totient is φ = 37640367648.
The previous prime is 56993199143. The next prime is 56993199167. The reversal of 56993199147 is 74199139965.
It is not a de Polignac number, because 56993199147 - 22 = 56993199143 is a prime.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (56993199143) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 29590522 + ... + 29592447.
It is an arithmetic number, because the mean of its divisors is an integer number (6924407490).
Almost surely, 256993199147 is an apocalyptic number.
56993199147 is a deficient number, since it is larger than the sum of its proper divisors (26099690733).
56993199147 is a wasteful number, since it uses less digits than its factorization.
56993199147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59183082 (or 59183079 counting only the distinct ones).
The product of its digits is 16533720, while the sum is 63.
It can be divided in two parts, 569 and 93199147, that added together give a square (93199716 = 96542).
The spelling of 56993199147 in words is "fifty-six billion, nine hundred ninety-three million, one hundred ninety-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •