Base | Representation |
---|---|
bin | 110100001101011011… |
… | …111101111001010111 |
3 | 12100200220210120122022 |
4 | 310031123331321113 |
5 | 1404302330310241 |
6 | 41430440323355 |
7 | 4023135136412 |
oct | 641533757127 |
9 | 170626716568 |
10 | 56060010071 |
11 | 2185846133a |
12 | aa4647355b |
13 | 53953ba1c0 |
14 | 29db4c0b79 |
15 | 16d18d354b |
hex | d0d6fde57 |
56060010071 has 16 divisors (see below), whose sum is σ = 60992389920. Its totient is φ = 51217246080.
The previous prime is 56060010053. The next prime is 56060010077. The reversal of 56060010071 is 17001006065.
It is a de Polignac number, because none of the positive numbers 2k-56060010071 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 56060010071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56060010077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1312376 + ... + 1354418.
It is an arithmetic number, because the mean of its divisors is an integer number (3812024370).
Almost surely, 256060010071 is an apocalyptic number.
56060010071 is a deficient number, since it is larger than the sum of its proper divisors (4932379849).
56060010071 is a wasteful number, since it uses less digits than its factorization.
56060010071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43106.
The product of its (nonzero) digits is 1260, while the sum is 26.
The spelling of 56060010071 in words is "fifty-six billion, sixty million, ten thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •