Base | Representation |
---|---|
bin | 110110011101111011… |
… | …0000111000110011111 |
3 | 102011220201020001121011 |
4 | 1230323312013012133 |
5 | 3404022322020344 |
6 | 125422345320051 |
7 | 11310402635506 |
oct | 1547366070637 |
9 | 364821201534 |
10 | 116968157599 |
11 | 45673526047 |
12 | 1a804496027 |
13 | b051034397 |
14 | 593881183d |
15 | 3098c21d34 |
hex | 1b3bd8719f |
116968157599 has 8 divisors (see below), whose sum is σ = 124962055040. Its totient is φ = 109158028056.
The previous prime is 116968157591. The next prime is 116968157623. The reversal of 116968157599 is 995751869611.
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 116968157599 - 23 = 116968157591 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116968157591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45940659 + ... + 45943204.
It is an arithmetic number, because the mean of its divisors is an integer number (15620256880).
Almost surely, 2116968157599 is an apocalyptic number.
116968157599 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
116968157599 is a deficient number, since it is larger than the sum of its proper divisors (7993897441).
116968157599 is an equidigital number, since it uses as much as digits as its factorization.
116968157599 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91883949.
The product of its digits is 36741600, while the sum is 67.
The spelling of 116968157599 in words is "one hundred sixteen billion, nine hundred sixty-eight million, one hundred fifty-seven thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •