Base | Representation |
---|---|
bin | 110110000010100010… |
… | …1111101000110011011 |
3 | 102002112200201200011012 |
4 | 1230011011331012123 |
5 | 3400132142022214 |
6 | 125151252524135 |
7 | 11245550006312 |
oct | 1540505750633 |
9 | 362480650135 |
10 | 116049564059 |
11 | 45241a54130 |
12 | 1a5a892064b |
13 | ac3592a800 |
14 | 588c815279 |
15 | 304327103e |
hex | 1b0517d19b |
116049564059 has 18 divisors (see below), whose sum is σ = 137104411788. Its totient is φ = 97371924000.
The previous prime is 116049564047. The next prime is 116049564107. The reversal of 116049564059 is 950465940611.
It is not a de Polignac number, because 116049564059 - 232 = 111754596763 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116049563998 and 116049564016.
It is not an unprimeable number, because it can be changed into a prime (116049564019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 14684009 + ... + 14691909.
It is an arithmetic number, because the mean of its divisors is an integer number (7616911766).
Almost surely, 2116049564059 is an apocalyptic number.
116049564059 is a deficient number, since it is larger than the sum of its proper divisors (21054847729).
116049564059 is an frugal number, since it uses more digits than its factorization.
116049564059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15839 (or 7925 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 116049564059 in words is "one hundred sixteen billion, forty-nine million, five hundred sixty-four thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •