Base | Representation |
---|---|
bin | 110110000100110100… |
… | …0000110111011010001 |
3 | 102002201222212000121112 |
4 | 1230021220012323101 |
5 | 3400311130013230 |
6 | 125203011103105 |
7 | 11250462351401 |
oct | 1541150067321 |
9 | 362658760545 |
10 | 116125626065 |
11 | 45280985699 |
12 | 1a60a2a1a95 |
13 | ac4860c607 |
14 | 5898974801 |
15 | 3049c97d95 |
hex | 1b09a06ed1 |
116125626065 has 8 divisors (see below), whose sum is σ = 142591466688. Its totient is φ = 90740023920.
The previous prime is 116125626037. The next prime is 116125626157. The reversal of 116125626065 is 560626521611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116125626065 - 210 = 116125625041 is a prime.
It is a super-2 number, since 2×1161256260652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 270059381 + ... + 270059810.
It is an arithmetic number, because the mean of its divisors is an integer number (17823933336).
Almost surely, 2116125626065 is an apocalyptic number.
It is an amenable number.
116125626065 is a deficient number, since it is larger than the sum of its proper divisors (26465840623).
116125626065 is an equidigital number, since it uses as much as digits as its factorization.
116125626065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540119239.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 116125626065 in words is "one hundred sixteen billion, one hundred twenty-five million, six hundred twenty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.285 sec. • engine limits •