Base | Representation |
---|---|
bin | 110000111001100110100100… |
… | …010100111011000111100101 |
3 | 1001012110222110112120021122012 |
4 | 300321212210110323013211 |
5 | 211142104403004023221 |
6 | 2041223201022244005 |
7 | 63204623423514611 |
oct | 6071464424730745 |
9 | 1035428415507565 |
10 | 215064654361061 |
11 | 6258745373227a |
12 | 20154b79726605 |
13 | 93006822aa22b |
14 | 3b1728319a341 |
15 | 19ce4d288665b |
hex | c399a453b1e5 |
215064654361061 has 2 divisors, whose sum is σ = 215064654361062. Its totient is φ = 215064654361060.
The previous prime is 215064654361003. The next prime is 215064654361079. The reversal of 215064654361061 is 160163456460512.
215064654361061 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., 163747059584161 + 51317594776900 = 12796369^2 + 7163630^2 .
It is a cyclic number.
It is not a de Polignac number, because 215064654361061 - 210 = 215064654360037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215064654361861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107532327180530 + 107532327180531.
It is an arithmetic number, because the mean of its divisors is an integer number (107532327180531).
Almost surely, 2215064654361061 is an apocalyptic number.
It is an amenable number.
215064654361061 is a deficient number, since it is larger than the sum of its proper divisors (1).
215064654361061 is an equidigital number, since it uses as much as digits as its factorization.
215064654361061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3110400, while the sum is 50.
The spelling of 215064654361061 in words is "two hundred fifteen trillion, sixty-four billion, six hundred fifty-four million, three hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •