Base | Representation |
---|---|
bin | 110100001011111010… |
… | …000001011000110101 |
3 | 12100122010111010001101 |
4 | 310023322001120311 |
5 | 1404224242144021 |
6 | 41424122130101 |
7 | 4022403661003 |
oct | 641372013065 |
9 | 170563433041 |
10 | 56034334261 |
11 | 21844a14764 |
12 | aa39950931 |
13 | 538cc9a509 |
14 | 29d7d19a73 |
15 | 16ce510a91 |
hex | d0be81635 |
56034334261 has 8 divisors (see below), whose sum is σ = 56995653600. Its totient is φ = 55073401200.
The previous prime is 56034334259. The next prime is 56034334283. The reversal of 56034334261 is 16243343065.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56034334261 - 21 = 56034334259 is a prime.
It is a super-2 number, since 2×560343342612 (a number of 22 digits) contains 22 as substring.
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 56034334261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56034334241) 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 7 ways as a sum of consecutive naturals, for example, 203995 + ... + 392023.
It is an arithmetic number, because the mean of its divisors is an integer number (7124456700).
Almost surely, 256034334261 is an apocalyptic number.
It is an amenable number.
56034334261 is a deficient number, since it is larger than the sum of its proper divisors (961319339).
56034334261 is a wasteful number, since it uses less digits than its factorization.
56034334261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193139.
The product of its (nonzero) digits is 155520, while the sum is 37.
The spelling of 56034334261 in words is "fifty-six billion, thirty-four million, three hundred thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •