Base | Representation |
---|---|
bin | 110101000010101011… |
… | …011101001001001101 |
3 | 12110000011121111211212 |
4 | 311002223131021031 |
5 | 1413120013401134 |
6 | 42055230024205 |
7 | 4054232513402 |
oct | 650253351115 |
9 | 173004544755 |
10 | 56953262669 |
11 | 221766a5226 |
12 | b055648065 |
13 | 54a8490634 |
14 | 2a83da22a9 |
15 | 173502abce |
hex | d42add24d |
56953262669 has 2 divisors, whose sum is σ = 56953262670. Its totient is φ = 56953262668.
The previous prime is 56953262629. The next prime is 56953262671. The reversal of 56953262669 is 96626235965.
56953262669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38666109769 + 18287152900 = 196637^2 + 135230^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56953262669 is a prime.
It is a super-2 number, since 2×569532626692 (a number of 22 digits) contains 22 as substring.
Together with 56953262671, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56953262629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28476631334 + 28476631335.
It is an arithmetic number, because the mean of its divisors is an integer number (28476631335).
Almost surely, 256953262669 is an apocalyptic number.
It is an amenable number.
56953262669 is a deficient number, since it is larger than the sum of its proper divisors (1).
56953262669 is an equidigital number, since it uses as much as digits as its factorization.
56953262669 is an evil number, because the sum of its binary digits is even.
The product of its digits is 31492800, while the sum is 59.
The spelling of 56953262669 in words is "fifty-six billion, nine hundred fifty-three million, two hundred sixty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •