Base | Representation |
---|---|
bin | 11011110000111101101011… |
… | …00011010111100111011101 |
3 | 22000011220020001002121012122 |
4 | 31320132311203113213131 |
5 | 31000320200022414014 |
6 | 333504424133112325 |
7 | 15601102514356625 |
oct | 1570366543274735 |
9 | 260156201077178 |
10 | 61056006060509 |
11 | 184aa785770219 |
12 | 6a21090a886a5 |
13 | 280b730cc51b5 |
14 | 11111ab019885 |
15 | 70d3180e258e |
hex | 3787b58d79dd |
61056006060509 has 2 divisors, whose sum is σ = 61056006060510. Its totient is φ = 61056006060508.
The previous prime is 61056006060503. The next prime is 61056006060529. The reversal of 61056006060509 is 90506060065016.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42164204599609 + 18891801460900 = 6493397^2 + 4346470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61056006060509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61056006060509.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61056006060503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30528003030254 + 30528003030255.
It is an arithmetic number, because the mean of its divisors is an integer number (30528003030255).
Almost surely, 261056006060509 is an apocalyptic number.
It is an amenable number.
61056006060509 is a deficient number, since it is larger than the sum of its proper divisors (1).
61056006060509 is an equidigital number, since it uses as much as digits as its factorization.
61056006060509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 44.
The spelling of 61056006060509 in words is "sixty-one trillion, fifty-six billion, six million, sixty thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •