Base | Representation |
---|---|
bin | 110100101101101110… |
… | …001000101110010001 |
3 | 12102002122222102121021 |
4 | 310231232020232101 |
5 | 1411410010101141 |
6 | 42000305355441 |
7 | 4042433015014 |
oct | 645556105621 |
9 | 172078872537 |
10 | 56601643921 |
11 | 22006174919 |
12 | ab77938b81 |
13 | 545068b6c4 |
14 | 2a4d3d337b |
15 | 17142226d1 |
hex | d2db88b91 |
56601643921 has 3 divisors (see below), whose sum is σ = 56601881833. Its totient is φ = 56601406010.
The previous prime is 56601643919. The next prime is 56601643949. The reversal of 56601643921 is 12934610665.
The square root of 56601643921 is 237911.
It is a perfect power (a square), and thus also a powerful number.
56601643921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 56601643921 - 21 = 56601643919 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56601643951) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 118956 + ... + 356866.
Almost surely, 256601643921 is an apocalyptic number.
56601643921 is the 237911-st square number.
56601643921 is the 118956-th centered octagonal number.
It is an amenable number.
56601643921 is a deficient number, since it is larger than the sum of its proper divisors (237912).
56601643921 is an frugal number, since it uses more digits than its factorization.
56601643921 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 475822 (or 237911 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 56601643921 in words is "fifty-six billion, six hundred one million, six hundred forty-three thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •