Base | Representation |
---|---|
bin | 110110010100000110… |
… | …1110110011110000011 |
3 | 102011001202112211010112 |
4 | 1230220031312132003 |
5 | 3402334020232421 |
6 | 125325543021535 |
7 | 11266263516143 |
oct | 1545015663603 |
9 | 364052484115 |
10 | 116638836611 |
11 | 45514645340 |
12 | 1a73213a8ab |
13 | accaa3b6ab |
14 | 5906ba8923 |
15 | 3079d7045b |
hex | 1b28376783 |
116638836611 has 8 divisors (see below), whose sum is σ = 127345245744. Its totient is φ = 105949573920.
The previous prime is 116638836583. The next prime is 116638836683.
116638836611 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116638836611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116638836611.
It is not an unprimeable number, because it can be changed into a prime (116638833611) 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, 4272380 + ... + 4299593.
It is an arithmetic number, because the mean of its divisors is an integer number (15918155718).
Almost surely, 2116638836611 is an apocalyptic number.
116638836611 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116638836611 is a deficient number, since it is larger than the sum of its proper divisors (10706409133).
116638836611 is a wasteful number, since it uses less digits than its factorization.
116638836611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8573221.
The product of its digits is 746496, while the sum is 50.
The spelling of 116638836611 in words is "one hundred sixteen billion, six hundred thirty-eight million, eight hundred thirty-six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •