Base | Representation |
---|---|
bin | 11001110001010110100010… |
… | …00111100001101000000111 |
3 | 21102122201112211002102210122 |
4 | 30320223101013201220013 |
5 | 24412000314032224221 |
6 | 320310234453212155 |
7 | 14636236546515635 |
oct | 1470532107415007 |
9 | 242581484072718 |
10 | 56671306914311 |
11 | 1706a191376181 |
12 | 643334203105b |
13 | 2581109843a9b |
14 | ddcc97a94355 |
15 | 68423db7eeab |
hex | 338ad11e1a07 |
56671306914311 has 2 divisors, whose sum is σ = 56671306914312. Its totient is φ = 56671306914310.
The previous prime is 56671306914259. The next prime is 56671306914317. The reversal of 56671306914311 is 11341960317665.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56671306914311 - 242 = 52273260403207 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56671306914317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28335653457155 + 28335653457156.
It is an arithmetic number, because the mean of its divisors is an integer number (28335653457156).
Almost surely, 256671306914311 is an apocalyptic number.
56671306914311 is a deficient number, since it is larger than the sum of its proper divisors (1).
56671306914311 is an equidigital number, since it uses as much as digits as its factorization.
56671306914311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 53.
The spelling of 56671306914311 in words is "fifty-six trillion, six hundred seventy-one billion, three hundred six million, nine hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •