Base | Representation |
---|---|
bin | 11011101100000011000100… |
… | …10010111010101101111001 |
3 | 21222120202021001220212020101 |
4 | 31312001202102322231321 |
5 | 30440033243002424421 |
6 | 333255052232155401 |
7 | 15552643143411400 |
oct | 1566014222725571 |
9 | 258522231825211 |
10 | 60887105514361 |
11 | 18445092814aa5 |
12 | 69b43b4538b61 |
13 | 27c8824a8a329 |
14 | 1106d473bc637 |
15 | 708c30071191 |
hex | 3760624bab79 |
60887105514361 has 27 divisors (see below), whose sum is σ = 71078894133957. Its totient is φ = 52004624668920.
The previous prime is 60887105514349. The next prime is 60887105514379. The reversal of 60887105514361 is 16341550178806.
The square root of 60887105514361 is 7803019.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 60887105514361 - 221 = 60887103417209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60887105514061) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 16768686016 + ... + 16768689646.
It is an arithmetic number, because the mean of its divisors is an integer number (2632551634591).
Almost surely, 260887105514361 is an apocalyptic number.
60887105514361 is the 7803019-th square number.
60887105514361 is the 3901510-th centered octagonal number.
It is an amenable number.
60887105514361 is a deficient number, since it is larger than the sum of its proper divisors (10191788619596).
60887105514361 is an frugal number, since it uses more digits than its factorization.
60887105514361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7890 (or 3945 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 55.
The spelling of 60887105514361 in words is "sixty trillion, eight hundred eighty-seven billion, one hundred five million, five hundred fourteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •