Base | Representation |
---|---|
bin | 110110000011110001… |
… | …1010000011011100001 |
3 | 102002122120022200000101 |
4 | 1230013203100123201 |
5 | 3400223221043331 |
6 | 125155324422401 |
7 | 11246560342252 |
oct | 1540743203341 |
9 | 362576280011 |
10 | 116090799841 |
11 | 45263259195 |
12 | 1a5ba6a7a01 |
13 | ac41337993 |
14 | 58940aab29 |
15 | 3046bb9061 |
hex | 1b078d06e1 |
116090799841 has 27 divisors (see below), whose sum is σ = 124564194963. Its totient is φ = 108185731920.
The previous prime is 116090799791. The next prime is 116090799901. The reversal of 116090799841 is 148997090611.
The square root of 116090799841 is 340721.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 60875199441 + 55215600400 = 246729^2 + 234980^2 .
It is not a de Polignac number, because 116090799841 - 217 = 116090668769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116090799941) 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, 306307990 + ... + 306308368.
Almost surely, 2116090799841 is an apocalyptic number.
116090799841 is the 340721-st square number.
116090799841 is the 170361-st centered octagonal number.
It is an amenable number.
116090799841 is a deficient number, since it is larger than the sum of its proper divisors (8473395122).
116090799841 is an frugal number, since it uses more digits than its factorization.
116090799841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878 (or 439 counting only the distinct ones).
The product of its (nonzero) digits is 979776, while the sum is 55.
The spelling of 116090799841 in words is "one hundred sixteen billion, ninety million, seven hundred ninety-nine thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •