Base | Representation |
---|---|
bin | 1101111100010… |
… | …01111111010111 |
3 | 22011002001001001 |
4 | 12332021333113 |
5 | 214420112033 |
6 | 15334444131 |
7 | 2620055632 |
oct | 676117727 |
9 | 264061031 |
10 | 116957143 |
11 | 600236a6 |
12 | 33203647 |
13 | 1b2ccc14 |
14 | 11766c19 |
15 | a403e7d |
hex | 6f89fd7 |
116957143 has 4 divisors (see below), whose sum is σ = 118702840. Its totient is φ = 115211448.
The previous prime is 116957123. The next prime is 116957149. The reversal of 116957143 is 341759611.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341759611 = 499 ⋅684889.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116957143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116957149) 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 3 ways as a sum of consecutive naturals, for example, 872748 + ... + 872881.
It is an arithmetic number, because the mean of its divisors is an integer number (29675710).
Almost surely, 2116957143 is an apocalyptic number.
116957143 is a deficient number, since it is larger than the sum of its proper divisors (1745697).
116957143 is an equidigital number, since it uses as much as digits as its factorization.
116957143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1745696.
The product of its digits is 22680, while the sum is 37.
The square root of 116957143 is about 10814.6725794173. The cubic root of 116957143 is about 489.0375987138.
The spelling of 116957143 in words is "one hundred sixteen million, nine hundred fifty-seven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •