Base | Representation |
---|---|
bin | 110100111111000010… |
… | …100000010101111001 |
3 | 12102211220201000102102 |
4 | 310333002200111321 |
5 | 1413003400234332 |
6 | 42045205113145 |
7 | 4052561455163 |
oct | 647702402571 |
9 | 172756630372 |
10 | 56892196217 |
11 | 2214518608a |
12 | b0390b87b5 |
13 | 549892c13c |
14 | 2a79c27933 |
15 | 172e9b7062 |
hex | d3f0a0579 |
56892196217 has 2 divisors, whose sum is σ = 56892196218. Its totient is φ = 56892196216.
The previous prime is 56892196121. The next prime is 56892196271. The reversal of 56892196217 is 71269129865.
56892196217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (56892196271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49813329721 + 7078866496 = 223189^2 + 84136^2 .
It is a cyclic number.
It is not a de Polignac number, because 56892196217 - 214 = 56892179833 is a prime.
It is a super-2 number, since 2×568921962172 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56892196297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28446098108 + 28446098109.
It is an arithmetic number, because the mean of its divisors is an integer number (28446098109).
Almost surely, 256892196217 is an apocalyptic number.
It is an amenable number.
56892196217 is a deficient number, since it is larger than the sum of its proper divisors (1).
56892196217 is an equidigital number, since it uses as much as digits as its factorization.
56892196217 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3265920, while the sum is 56.
The spelling of 56892196217 in words is "fifty-six billion, eight hundred ninety-two million, one hundred ninety-six thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •