Base | Representation |
---|---|
bin | 11010011001101101111110… |
… | …000010111100111110111111 |
3 | 120020010122010101220210021210 |
4 | 122121231332002330332333 |
5 | 110204423201210110110 |
6 | 1050543113104455503 |
7 | 33313100331050052 |
oct | 3231557602747677 |
9 | 506118111823253 |
10 | 116116555550655 |
11 | 33aa8833501a10 |
12 | 110341bb61a593 |
13 | 4ca398a02b9ba |
14 | 20960dd818a99 |
15 | d656d1068520 |
hex | 699b7e0bcfbf |
116116555550655 has 16 divisors (see below), whose sum is σ = 202676169688704. Its totient is φ = 56298936024480.
The previous prime is 116116555550627. The next prime is 116116555550669. The reversal of 116116555550655 is 556055555611611.
It is not a de Polignac number, because 116116555550655 - 212 = 116116555546559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116116555550595 and 116116555550604.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 351868349989 + ... + 351868350318.
It is an arithmetic number, because the mean of its divisors is an integer number (12667260605544).
Almost surely, 2116116555550655 is an apocalyptic number.
116116555550655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116116555550655 is a deficient number, since it is larger than the sum of its proper divisors (86559614138049).
116116555550655 is a wasteful number, since it uses less digits than its factorization.
116116555550655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703736700326.
The product of its (nonzero) digits is 16875000, while the sum is 57.
The spelling of 116116555550655 in words is "one hundred sixteen trillion, one hundred sixteen billion, five hundred fifty-five million, five hundred fifty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •