Base | Representation |
---|---|
bin | 110110011101000011… |
… | …0111111011100100001 |
3 | 102011211200102010122122 |
4 | 1230322012333130201 |
5 | 3403442342401012 |
6 | 125415425114025 |
7 | 11306600224352 |
oct | 1547206773441 |
9 | 364750363578 |
10 | 116939028257 |
11 | 4565903a807 |
12 | 1a7b6788915 |
13 | b047ca579c |
14 | 59349cbd29 |
15 | 30963bae72 |
hex | 1b3a1bf721 |
116939028257 has 32 divisors (see below), whose sum is σ = 122425344000. Its totient is φ = 111619883200.
The previous prime is 116939028233. The next prime is 116939028259. The reversal of 116939028257 is 752820939611.
It is a cyclic number.
It is not a de Polignac number, because 116939028257 - 214 = 116939011873 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116939028199 and 116939028208.
It is not an unprimeable number, because it can be changed into a prime (116939028259) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 238164782 + ... + 238165272.
It is an arithmetic number, because the mean of its divisors is an integer number (3825792000).
Almost surely, 2116939028257 is an apocalyptic number.
It is an amenable number.
116939028257 is a deficient number, since it is larger than the sum of its proper divisors (5486315743).
116939028257 is a wasteful number, since it uses less digits than its factorization.
116939028257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1237.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 116939028257 in words is "one hundred sixteen billion, nine hundred thirty-nine million, twenty-eight thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •