Base | Representation |
---|---|
bin | 110110101100011110… |
… | …0010001101010000001 |
3 | 102020011201202220212101 |
4 | 1231120330101222001 |
5 | 3411022304003321 |
6 | 125543024230401 |
7 | 11325451121131 |
oct | 1553074215201 |
9 | 366151686771 |
10 | 117456312961 |
11 | 458a4032429 |
12 | 1a91ba6b401 |
13 | b0cb200100 |
14 | 59835a2ac1 |
15 | 30c69ea791 |
hex | 1b58f11a81 |
117456312961 has 27 divisors (see below), whose sum is σ = 130567249737. Its totient is φ = 105612287040.
The previous prime is 117456312931. The next prime is 117456312973. The reversal of 117456312961 is 169213654711.
The square root of 117456312961 is 342719.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 78234887025 + 39221425936 = 279705^2 + 198044^2 .
It is not a de Polignac number, because 117456312961 - 25 = 117456312929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117456312931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 182668906 + ... + 182669548.
Almost surely, 2117456312961 is an apocalyptic number.
117456312961 is the 342719-th square number.
117456312961 is the 171360-th centered octagonal number.
It is an amenable number.
117456312961 is a deficient number, since it is larger than the sum of its proper divisors (13110936776).
117456312961 is an frugal number, since it uses more digits than its factorization.
117456312961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1394 (or 697 counting only the distinct ones).
The product of its digits is 272160, while the sum is 46.
The spelling of 117456312961 in words is "one hundred seventeen billion, four hundred fifty-six million, three hundred twelve thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •