Base | Representation |
---|---|
bin | 11010101000001010000101… |
… | …001111101110111010111011 |
3 | 120100122111022120211212021121 |
4 | 122220022011033232322323 |
5 | 110322202322312134221 |
6 | 1053023014002250111 |
7 | 33444555401643040 |
oct | 3250120517567273 |
9 | 510574276755247 |
10 | 117108813786811 |
11 | 343506293a9070 |
12 | 11174580956937 |
13 | 504641041b892 |
14 | 20cc14d9b91c7 |
15 | d81407ce3a41 |
hex | 6a82853eeebb |
117108813786811 has 16 divisors (see below), whose sum is σ = 148480468289280. Its totient is φ = 89706949584480.
The previous prime is 117108813786793. The next prime is 117108813786821. The reversal of 117108813786811 is 118687318801711.
It is a cyclic number.
It is not a de Polignac number, because 117108813786811 - 25 = 117108813786779 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 117108813786811.
It is not an unprimeable number, because it can be changed into a prime (117108813786821) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12888924996 + ... + 12888934081.
It is an arithmetic number, because the mean of its divisors is an integer number (9280029268080).
Almost surely, 2117108813786811 is an apocalyptic number.
117108813786811 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
117108813786811 is a deficient number, since it is larger than the sum of its proper divisors (31371654502469).
117108813786811 is a wasteful number, since it uses less digits than its factorization.
117108813786811 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25777859154.
The product of its (nonzero) digits is 3612672, while the sum is 61.
The spelling of 117108813786811 in words is "one hundred seventeen trillion, one hundred eight billion, eight hundred thirteen million, seven hundred eighty-six thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •