Base | Representation |
---|---|
bin | 1101110110000… |
… | …11010011011111 |
3 | 22002112200200201 |
4 | 12323003103133 |
5 | 214213041302 |
6 | 15305204331 |
7 | 2610126166 |
oct | 673032337 |
9 | 262480621 |
10 | 116143327 |
11 | 5a618223 |
12 | 32a906a7 |
13 | 1b0a6681 |
14 | 115d43dd |
15 | a2e2c87 |
hex | 6ec34df |
116143327 has 2 divisors, whose sum is σ = 116143328. Its totient is φ = 116143326.
The previous prime is 116143253. The next prime is 116143369. The reversal of 116143327 is 723341611.
It is a strong prime.
It is an emirp because it is prime and its reverse (723341611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116143327 - 27 = 116143199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116143295 and 116143304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116143427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58071663 + 58071664.
It is an arithmetic number, because the mean of its divisors is an integer number (58071664).
Almost surely, 2116143327 is an apocalyptic number.
116143327 is a deficient number, since it is larger than the sum of its proper divisors (1).
116143327 is an equidigital number, since it uses as much as digits as its factorization.
116143327 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3024, while the sum is 28.
The square root of 116143327 is about 10776.9813491534. The cubic root of 116143327 is about 487.9006771233.
Adding to 116143327 its reverse (723341611), we get a palindrome (839484938).
It can be divided in two parts, 11614 and 3327, that added together give a palindrome (14941).
The spelling of 116143327 in words is "one hundred sixteen million, one hundred forty-three thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •