Base | Representation |
---|---|
bin | 110110001101110010… |
… | …0000001011011110011 |
3 | 102010111222002021121221 |
4 | 1230123210001123303 |
5 | 3401420143414013 |
6 | 125252520525511 |
7 | 11261105205625 |
oct | 1543344013363 |
9 | 363458067557 |
10 | 116426544883 |
11 | 45415827430 |
12 | 1a693020897 |
13 | ac95a6c69c |
14 | 58c6906c15 |
15 | 30663d908d |
hex | 1b1b9016f3 |
116426544883 has 8 divisors (see below), whose sum is σ = 127018693296. Its totient is φ = 105835716000.
The previous prime is 116426544877. The next prime is 116426544889. The reversal of 116426544883 is 388445624611.
It is an interprime number because it is at equal distance from previous prime (116426544877) and next prime (116426544889).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116426544883 - 29 = 116426544371 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116426544883.
It is not an unprimeable number, because it can be changed into a prime (116426544889) 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 7 ways as a sum of consecutive naturals, for example, 140668 + ... + 502633.
It is an arithmetic number, because the mean of its divisors is an integer number (15877336662).
Almost surely, 2116426544883 is an apocalyptic number.
116426544883 is a deficient number, since it is larger than the sum of its proper divisors (10592148413).
116426544883 is a wasteful number, since it uses less digits than its factorization.
116426544883 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659765.
The product of its digits is 4423680, while the sum is 52.
The spelling of 116426544883 in words is "one hundred sixteen billion, four hundred twenty-six million, five hundred forty-four thousand, eight hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •