Base | Representation |
---|---|
bin | 11010100001111101110100… |
… | …101010101111011010111000 |
3 | 120022010211002011100201020101 |
4 | 122201331310222233122320 |
5 | 110243214431434014033 |
6 | 1052055330015405144 |
7 | 33402043534340530 |
oct | 3241756452573270 |
9 | 508124064321211 |
10 | 116683333891768 |
11 | 341a7140065476 |
12 | 111060185237b4 |
13 | 5015264011087 |
14 | 20b570982c4c0 |
15 | d7530453197d |
hex | 6a1f74aaf6b8 |
116683333891768 has 16 divisors (see below), whose sum is σ = 250035715482480. Its totient is φ = 50007143096448.
The previous prime is 116683333891759. The next prime is 116683333891769. The reversal of 116683333891768 is 867198333386611.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 116683333891768.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116683333891769) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1041815481121 + ... + 1041815481232.
It is an arithmetic number, because the mean of its divisors is an integer number (15627232217655).
Almost surely, 2116683333891768 is an apocalyptic number.
It is an amenable number.
116683333891768 is an abundant number, since it is smaller than the sum of its proper divisors (133352381590712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116683333891768 is a wasteful number, since it uses less digits than its factorization.
116683333891768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2083630962366 (or 2083630962362 counting only the distinct ones).
The product of its digits is 564350976, while the sum is 73.
The spelling of 116683333891768 in words is "one hundred sixteen trillion, six hundred eighty-three billion, three hundred thirty-three million, eight hundred ninety-one thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •