Base | Representation |
---|---|
bin | 11001110101111101100100… |
… | …00111101001010110010001 |
3 | 21110012212101112211111200122 |
4 | 30322332302013221112101 |
5 | 24422044211331022233 |
6 | 320511112024400025 |
7 | 14653544650140023 |
oct | 1472766207512621 |
9 | 243185345744618 |
10 | 56829700642193 |
11 | 17120382513316 |
12 | 6459b87916015 |
13 | 259303008cb1b |
14 | 1006802120013 |
15 | 68840e5ced98 |
hex | 33afb21e9591 |
56829700642193 has 2 divisors, whose sum is σ = 56829700642194. Its totient is φ = 56829700642192.
The previous prime is 56829700642171. The next prime is 56829700642201. The reversal of 56829700642193 is 39124600792865.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45702359163904 + 11127341478289 = 6760352^2 + 3335767^2 .
It is a cyclic number.
It is not a de Polignac number, because 56829700642193 - 26 = 56829700642129 is a prime.
It is a super-2 number, since 2×568297006421932 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56829700642103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28414850321096 + 28414850321097.
It is an arithmetic number, because the mean of its divisors is an integer number (28414850321097).
It is a 1-persistent number, because it is pandigital, but 2⋅56829700642193 = 113659401284386 is not.
Almost surely, 256829700642193 is an apocalyptic number.
It is an amenable number.
56829700642193 is a deficient number, since it is larger than the sum of its proper divisors (1).
56829700642193 is an equidigital number, since it uses as much as digits as its factorization.
56829700642193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39191040, while the sum is 62.
The spelling of 56829700642193 in words is "fifty-six trillion, eight hundred twenty-nine billion, seven hundred million, six hundred forty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •