Base | Representation |
---|---|
bin | 110100010111000100… |
… | …011011001010101111 |
3 | 12101010011212201222201 |
4 | 310113010123022233 |
5 | 1410120213020141 |
6 | 41454452122331 |
7 | 4030136543242 |
oct | 642704331257 |
9 | 171104781881 |
10 | 56221610671 |
11 | 219306a7256 |
12 | aa906063a7 |
13 | 53bca1b365 |
14 | 2a14b49259 |
15 | 16e0ba5031 |
hex | d1711b2af |
56221610671 has 4 divisors (see below), whose sum is σ = 57282395832. Its totient is φ = 55160825512.
The previous prime is 56221610647. The next prime is 56221610719. The reversal of 56221610671 is 17601612265.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17601612265 = 5 ⋅3520322453.
It is a cyclic number.
It is not a de Polignac number, because 56221610671 - 215 = 56221577903 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 56221610671.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56221610771) 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, 530392501 + ... + 530392606.
It is an arithmetic number, because the mean of its divisors is an integer number (14320598958).
Almost surely, 256221610671 is an apocalyptic number.
56221610671 is a deficient number, since it is larger than the sum of its proper divisors (1060785161).
56221610671 is a wasteful number, since it uses less digits than its factorization.
56221610671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060785160.
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 56221610671 in words is "fifty-six billion, two hundred twenty-one million, six hundred ten thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •