Base | Representation |
---|---|
bin | 110110010111000011… |
… | …1000000011001011001 |
3 | 102011022122120212211111 |
4 | 1230232013000121121 |
5 | 3403034323034221 |
6 | 125343434100321 |
7 | 11301604060621 |
oct | 1545607003131 |
9 | 364278525744 |
10 | 116737705561 |
11 | 45565434014 |
12 | 1a75b27a6a1 |
13 | b015377429 |
14 | 5915d83881 |
15 | 308389ebe1 |
hex | 1b2e1c0659 |
116737705561 has 9 divisors (see below), whose sum is σ = 118770355893. Its totient is φ = 114739283580.
The previous prime is 116737705537. The next prime is 116737705571. The reversal of 116737705561 is 165507737611.
The square root of 116737705561 is 341669.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 116737705561 - 219 = 116737181273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116737705571) 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 8 ways as a sum of consecutive naturals, for example, 20155576 + ... + 20161366.
Almost surely, 2116737705561 is an apocalyptic number.
116737705561 is the 341669-th square number.
116737705561 is the 170835-th centered octagonal number.
It is an amenable number.
116737705561 is a deficient number, since it is larger than the sum of its proper divisors (2032650332).
116737705561 is an frugal number, since it uses more digits than its factorization.
116737705561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11700 (or 5850 counting only the distinct ones).
The product of its (nonzero) digits is 926100, while the sum is 49.
Multiplying 116737705561 by its sum of digits (49), we get a square (5720147572489 = 23916832).
The spelling of 116737705561 in words is "one hundred sixteen billion, seven hundred thirty-seven million, seven hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •