Base | Representation |
---|---|
bin | 110101000010111010… |
… | …010011001011011101 |
3 | 12110000102221012202201 |
4 | 311002322103023131 |
5 | 1413122012412023 |
6 | 42055445251501 |
7 | 4054310551414 |
oct | 650272231335 |
9 | 173012835681 |
10 | 56957154013 |
11 | 22178912911 |
12 | b056a03b91 |
13 | 54a92238c6 |
14 | 2a846d647b |
15 | 1735548bad |
hex | d42e932dd |
56957154013 has 4 divisors (see below), whose sum is σ = 57059411580. Its totient is φ = 56854896448.
The previous prime is 56957153963. The next prime is 56957154041. The reversal of 56957154013 is 31045175965.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31045175965 = 5 ⋅6209035193.
It can be written as a sum of positive squares in 2 ways, for example, as 34203543364 + 22753610649 = 184942^2 + 150843^2 .
It is a cyclic number.
It is not a de Polignac number, because 56957154013 - 221 = 56955056861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56957154073) 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 3 ways as a sum of consecutive naturals, for example, 51127948 + ... + 51129061.
It is an arithmetic number, because the mean of its divisors is an integer number (14264852895).
Almost surely, 256957154013 is an apocalyptic number.
It is an amenable number.
56957154013 is a deficient number, since it is larger than the sum of its proper divisors (102257567).
56957154013 is a wasteful number, since it uses less digits than its factorization.
56957154013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102257566.
The product of its (nonzero) digits is 567000, while the sum is 46.
The spelling of 56957154013 in words is "fifty-six billion, nine hundred fifty-seven million, one hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •