Base | Representation |
---|---|
bin | 11011110001000111111011… |
… | …01001001100101100100101 |
3 | 22000012102102122200212220202 |
4 | 31320203331221030230211 |
5 | 31000412433142443433 |
6 | 333511134244440245 |
7 | 15601356103434425 |
oct | 1570437551145445 |
9 | 260172378625822 |
10 | 61061510515493 |
11 | 1850204a8a7774 |
12 | 6a221683a9085 |
13 | 280c0ca508857 |
14 | 11115700b2485 |
15 | 70d53b491ee8 |
hex | 3788fda4cb25 |
61061510515493 has 2 divisors, whose sum is σ = 61061510515494. Its totient is φ = 61061510515492.
The previous prime is 61061510515349. The next prime is 61061510515507. The reversal of 61061510515493 is 39451501516016.
Together with previous prime (61061510515349) 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., 35323979786404 + 25737530729089 = 5943398^2 + 5073217^2 .
It is a cyclic number.
It is not a de Polignac number, because 61061510515493 - 210 = 61061510514469 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61061510505493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30530755257746 + 30530755257747.
It is an arithmetic number, because the mean of its divisors is an integer number (30530755257747).
Almost surely, 261061510515493 is an apocalyptic number.
It is an amenable number.
61061510515493 is a deficient number, since it is larger than the sum of its proper divisors (1).
61061510515493 is an equidigital number, since it uses as much as digits as its factorization.
61061510515493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 47.
The spelling of 61061510515493 in words is "sixty-one trillion, sixty-one billion, five hundred ten million, five hundred fifteen thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •