Base | Representation |
---|---|
bin | 1101111011101… |
… | …10001100111101 |
3 | 22010220220212012 |
4 | 12331312030331 |
5 | 214410013333 |
6 | 15333021005 |
7 | 2616300425 |
oct | 675661475 |
9 | 263826765 |
10 | 116876093 |
11 | 5aa78814 |
12 | 33184765 |
13 | 1b2a2069 |
14 | 11745485 |
15 | a3d9e48 |
hex | 6f7633d |
116876093 has 2 divisors, whose sum is σ = 116876094. Its totient is φ = 116876092.
The previous prime is 116876069. The next prime is 116876131. The reversal of 116876093 is 390678611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111978724 + 4897369 = 10582^2 + 2213^2 .
It is an emirp because it is prime and its reverse (390678611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116876093 - 210 = 116875069 is a prime.
It is a super-2 number, since 2×1168760932 = 27320042229889298, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 116876093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116876033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58438046 + 58438047.
It is an arithmetic number, because the mean of its divisors is an integer number (58438047).
Almost surely, 2116876093 is an apocalyptic number.
It is an amenable number.
116876093 is a deficient number, since it is larger than the sum of its proper divisors (1).
116876093 is an equidigital number, since it uses as much as digits as its factorization.
116876093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 116876093 is about 10810.9247060554. The cubic root of 116876093 is about 488.9246067358.
The spelling of 116876093 in words is "one hundred sixteen million, eight hundred seventy-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •