Base | Representation |
---|---|
bin | 110100101001100001… |
… | …000010010111010111 |
3 | 12101220202020111002210 |
4 | 310221201002113113 |
5 | 1411233430214033 |
6 | 41545305404503 |
7 | 4040615300646 |
oct | 645141022727 |
9 | 171822214083 |
10 | 56531101143 |
11 | 21a7a373000 |
12 | ab58199733 |
13 | 543bb8cb0a |
14 | 2a43cad35d |
15 | 170ce3ad63 |
hex | d298425d7 |
56531101143 has 32 divisors (see below), whose sum is σ = 84266106624. Its totient is φ = 33699468000.
The previous prime is 56531101141. The next prime is 56531101157. The reversal of 56531101143 is 34110113565.
It is not a de Polignac number, because 56531101143 - 21 = 56531101141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56531101143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56531101141) 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 31 ways as a sum of consecutive naturals, for example, 127528 + ... + 359618.
It is an arithmetic number, because the mean of its divisors is an integer number (2633315832).
Almost surely, 256531101143 is an apocalyptic number.
56531101143 is a deficient number, since it is larger than the sum of its proper divisors (27735005481).
56531101143 is a wasteful number, since it uses less digits than its factorization.
56531101143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232188 (or 232166 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 56531101143 in words is "fifty-six billion, five hundred thirty-one million, one hundred one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.477 sec. • engine limits •